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;
    int N = S.length();
    if(N < 5){
        cout << "NO" << endl;
        return 0;
    }
    if(S[0] != 'A')S = "A" + S;
    if(S[4] != 'A')S = S.substr(0, 4) + "A" + S.substr(4);
    if(S[6] != 'A')S = S.substr(0, 6) + "A" + S.substr(6);
    if(S[8] != 'A')S = S + "A";
    if(S == "AKIHABARA")cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}