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;
const string w = "AKIHABARA";
int main() {
    string s;
    cin >> s;

    for (int i = 0; i < w.size(); i++) {
        if (s.size() - 1 < i || (w[i] != s[i] && w[i] == 'A')) {
            string t = "A";
            s.insert(i, t);
        }
    }
    if (s != w) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
}