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 <iostream>
using namespace std;
int main(void){
    string s,t[3]={"KIH", "B", "R"};
    cin>>s;
    for(int i=0;i<16;i++){
        string u="";
        for(int j=0;j<4;j++){
            if(((i>>j)&1)==1){
                u+="A";
            }
            if(j<3){
                u+=t[j];
            }
        }
        //cout<<u<<endl;
        if(s==u){
            cout<<"YES"<<endl;
            return 0;
        }
    }
    cout<<"NO"<<endl;
    return 0;
}
