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 t = "AKIHABARA";
  if(s.length() > 9){
    cout << "NO" << endl;
    return 0;
  }
  int p = 0;
  int q = 0;
  string ans = "YES";
  while(q != 9){
    if(s[p] == t[q]){
      p++;
      q++;
    }
    else if(t[q] == 'A'){
      q++;
    }
    else{
      ans = "NO";
      break;
    }
  }
  if(p != s.length()) ans = "NO";
  cout << ans << endl;
  return 0;
}