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 ll=long long;

int main(){
  int i,j,cnt=0;
  string s;
  cin>>s;
  if(s[0]!='A')s='A'+s;
  if(s.substr(0,4)!="AKIH"){
    cout<<"NO";
    return 0;
  }
  s=s.substr(4);
  if(s[0]!='A')s='A'+s;
  if(s.substr(0,2)!="AB"){
    cout<<"NO";
    return 0;
  }
  s=s.substr(2);
  if(s[0]!='A')s='A'+s;
  if(s.substr(0,2)!="AR"){
    cout<<"NO";
    return 0;
  }
  s=s.substr(2);
  if(s=="" || s=="A"){
    cout<<"YES";
  }else cout<<"NO";
}