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;

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    string s;
    cin >> s;
    string e = "AKIHABARA";
    for (int i = 0; i < e.size(); i++) {
        if (s.size() < i) break;
        if (s.size() == i){
            if (e[i] == 'A') s.push_back('A');
            break;
        } 
        // i < s.size() 
        if (s[i] != e[i] && e[i] == 'A') {
            s.insert(i, "A");
        }
    }
    cout << (s == e ? "YES" : "NO") << endl;
    return 0;
}