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;
using Int = long long;
int main()
{
    string S; cin >> S;
    string T = "AKIHABARA";
    int i = 0;
    for (int j = 0; j < T.size(); j++) {
        if (i < S.size() && S[i] == T[j]) {
            i++;
        } else if (T[j] == 'A') {
        } else {
            goto FAIL;
        }
    }
    if (i != S.size()) goto FAIL;
    cout << "YES\n"; return 0;
    FAIL: cout << "NO\n";
    return 0;
}