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;
void dfs(int x,string a,string b,string c){
    if(x==a.length()){
        if(b==c){puts("YES");exit(0);}
        else return ;
    }
    if(a[x]=='A')dfs(x+1,a,b,c);
    dfs(x+1,a,b,c+a[x]);
}
int main(){
    string s,t="AKIHABARA";
    cin>>s;
    dfs(0,t,s,"");
    puts("NO");
}