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;

int main() {
	string s;
    cin >> s;
    vector<string> t{"KIH", "B", "R"};
    for (int bit = 0; bit < (1<<4); ++bit) {
        string target = "";
        for (int i = 0; i < 4; ++i) {
            if(bit & (1 << i)) {
                target += "A";
            }
            if(i < 3) target += t[i];
        }
        if(s == target) {
            puts("YES");
            return 0;
        }
    }
    puts("NO");
}
