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>
using namespace std;
int main()
{
  string s;
  cin>>s;
  if(s.size()>9||s.size()<5) {
    cout<<"NO";
    return 0;
  }
  string tmp;
  for(int i=0;i<s.size();i++){
    if(s[i]!='A'){
      tmp.push_back(s[i]);
    }
    if(i==s.size()-1);
    else if((s[i]=='K'||s[i]=='I'||s[i]=='A')&&s[i+1]=='A'){
      cout<<"NO";
      return 0;
    }
  }
  cout<<(tmp=="KIHBR"?"YES":"NO");
} 