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 <iostream>
using namespace std;

int main() {
    string s; cin >> s;
    string tar = "AKIHABARA";
    int i = 0, j = 0;
    while (i < (int) s.size() || j < (int) tar.size()) {
        if (i < (int) s.size() && j < (int) tar.size() && s[i] == tar[j]) {
            ++i;
            ++j;
        } else if (j < (int) tar.size() && tar[j] == 'A') {
            tar.erase(j, 1);
        } else {
            cout << "NO" << endl;
            return 0;
        }
    }
    cout << (tar == s ? "YES" : "NO");
}
