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;


int main(){
    string s; cin >> s;
    string ref = "AKIHABARA";
    int n=9;
    int s_p = 0;
    int s_len = s.size();
    for(int i=0; i<n; i++){
        if(ref[i]=='A'){
            if(s[s_p]=='A') s_p++;
        }
        else{
            if(ref[i]==s[s_p]) s_p++;
            else{
                cout << "NO" << endl;
                return 0;
            }
        }
    }
    if(s_p==s_len){
        cout << "YES" << endl;
    }
    else cout << "NO" << endl;
}