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;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    string S; cin >> S;
    vector<string> a={"KIH","B","R"};
    int ok=0;
    for (int mask=0;mask<(1<<4);++mask){
        string check="";
        for (int i=0;i<4;++i){
            if (mask&1<<i) check+='A';
            if (i<3) check+=a[i];
        }
        if (S==check) ok=1;
    }
    cout << (ok?"YES":"NO") << '\n';
}