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;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
typedef long long ll;

int main(){
    string s;
    cin >> s;
    string a[2] = {"A",""};
    bool can = false;
    rep(i,1 << 4){
        string t = a[1&(i>>0)] + "KIH" + a[1&(i>>1)] + "B" + a[1&(i>>2)] + "R" + a[1&(i>>3)];
        if(s == t) can = true;
    }
    cout << (can? "YES" : "NO") << endl;
    return 0;
}