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;
  set<char> s;
  s.insert('K');
  s.insert('B');
  s.insert('R');
  for(int i=0;i<S.size()-1;i++){
    if(S.at(i)=='A'){
      if(!s.count(S.at(i+1))){
        cout << "NO" << endl;
        return 0;
      }
    }
  }
  for(auto itr=S.begin();itr!=S.end();){
    if(*itr=='A'){
      itr=S.erase(itr);
    }else{
      itr++;
    }
  }
  if(S=="KIHBR"){
    cout << "YES" << endl;
  }else{
    cout << "NO" << endl;
  }
  return 0;
}
