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 inf 1000000000
#define mod 1000000007
using namespace std;
using LL = long long;

int main(){
    string s;cin>>s;
    if(s[s.size()-1]!='A')s+='A';
    if(s[0]!='A')s.insert(s.begin(),'A');

    if(s=="AKIHABARA" || s=="AKIHBARA" || s=="AKIHABRA" || s=="AKIHBRA")cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}