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>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

int main() {
    string S, T = "AKIHABARA";
    cin >> S;
    int i = 0;
    rep(j, 9) {
        if (S[i] == T[j]) {
            i++;
            continue;
        }
        if (T[j] == 'A') {
            continue;
        }
        cout << "NO\n";
        return 0;
    }
    if (i == S.size()) cout << "YES\n";
    else cout << "NO\n";
}