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;
using Int = long long;
bool f=0;
void dfs(string s,int i){
  if(s=="AKIHABARA"){
    f=1;
    return;
  }
  if(i>s.size()) return;
  dfs(s,i+1);
  s.insert(s.begin()+i,'A');
  dfs(s,i+2);
}
signed main(){
  string s;
  cin>>s;
  if(s.size()>9){
    cout<<"NO"<<endl;
    return 0;
  }
  dfs(s,0);
  if(!f) cout<<"NO"<<endl;
  else cout<<"YES"<<endl;
  return 0;
}
