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 akiba = "AKIHABARA";
void dfs(string s, int x){
    if(x!=-1){
        s.insert(x, "A");
    }
    if(s.size()==9){
        if(akiba==s) {cout<<"YES"<<endl; exit(0);}
        return ;
    } 
    for(int i=0;i<=s.size();i++){
        dfs(s, i);
    }
    return ;
}
int main(void){
    string s; cin>>s;
    if(s.size()>9) {cout<<"NO"<<endl; return 0;}
    dfs(s, -1);
    cout<<"NO"<<endl;
}
