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;
  string w="AKIHABARA";
  for(int mask=0;mask<(1<<9);mask++){
    bool t=true;
    string p="";
    for(int i=0;i<9;i++){
      if(mask &(1<<i)){
        p+=w[i];
      }else{
        t&=w[i]=='A';
      }
    }
    if(!t)continue;
    if(s==p){
      cout << "YES" << endl;
      return 0;
    }
    
  }
  cout << "NO" << endl;
}
