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>
#include<bitset>
using namespace std;
int main(){
    string a="AKIHABARA",s,c;
    cin>>s;
    for(int i=0;i<16;i++){
        bitset<4>b(i);
        c=a;
        for(int i=3;i>=0;i--)if(!b[i])c.erase(c.begin()+(i?2*i+2:0));
        if(s==c){cout<<"YES"<<endl;return 0;}
    }
    cout<<"NO"<<endl;
    return 0;
}