You are given a string S.

Takahashi can insert the character `A` at any position in this string any number of times.

Can he change S into `AKIHABARA`?

Constraints

* 1 \leq |S| \leq 50
* S consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:


S


Output

If it is possible to change S into `AKIHABARA`, print `YES`; otherwise, print `NO`.

Examples

Input

KIHBR


Output

YES


Input

AKIBAHARA


Output

NO


Input

AAKIAHBAARA


Output

NO
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
  string s,ans="AKIHABARA";
  int j=0;
  cin>>s;
  if(s.size()>9) cout<<"NO"<<endl;
  else{
  for(int i=0;i<ans.size();){
    if(s[i]!=ans[j]){
      if(ans[j]!='A'){
        cout<<"NO"<<endl;
        break;
      }else i--;
    }
    i++;
    j++;
    if(j==ans.size()) cout<<"YES"<<endl;
  }
  }
}