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;
#define vec(type) vector<type>

int main() {
    string s;
    cin >> s;

    string a = "AKIHABARA";
    for (int i = 0; i < 9; i++) {
        if (s[i] != a[i]) {
            s.insert(i,"A");
            if (s[i] != a[i]) {
                cout << "NO" << endl;
                return 0;
            }
        }
    }
    if (s.size() != 9) cout << "NO" << endl;
    else cout << "YES" << endl;
}