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>

#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long

using namespace std;

int main(){
  string s;cin>>s;
  string cor="AKIHABARA";
  int c=0;
  bool f=true;
  rep(i, cor.size()){
    if(s[c]==cor[i]){
      c++;
    }else if(s[c]!=cor[c] && cor[i]!='A'){
      f=false;
      break;
    }
  }
  if(c!=s.size())f=false;

//cout<<c<<' '<<s.size()<<endl;

  if(f)cout<<"YES";
  else cout<<"NO";

  return 0;
}