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;
typedef long long ll;
void Say(bool say, string a = "Yes", string b = "No"){cout << (say ? a : b) << endl;};

int main(){

    string s[4] = {"", "KIH", "B", "R"};
    string str;
    cin >> str;
    ll ans = 0;
    for(ll i = 0; i < 16; i++){
        string tmp = "";
        for(ll j = 0; j < 4; j++){
            tmp += s[j];
            if(i & (1 << j))tmp += "A";
        }
        if(tmp == str)ans = 1;
    }
    Say(ans, "YES", "NO");

    return 0;
}