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 x[] = {"KIH", "B", "R", ""};
    string s;
    cin >> s;
    for (int i = 0; i < (1 << 4); i++) {
        string res = "";
        for (int j = 0; j < 4; j++) {
            if ((1 << j) & i) {
                res += "A";
            }
            res += x[j];
        }
        if (s == res) {
            puts("YES");
            return 0;
        }
    }
    puts("NO");
}