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