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;

string s,t;

int main(){
t="AKIHABARA";
cin>>s;
  int n=s.size();
int ind=0;
for(char c:t){
  if(ind==n||s[ind]!=c){

  if(c!='A'){
    cout << "NO"<<endl;
    return 0;
  }
  }else{
  ++ind;
  }
}
if(ind!=n){
cout<<"NO"<<endl;
return 0;
}
cout<<"YES"<<endl;
return 0;
}
