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(){
  string s,t="AKIHABARA"; cin>>s;
  int n=s.size(), i=0, j=0;
  
  while(i<9){
    if(j<n && t[i]==s[j]){++i; ++j;}
    else if(t[i]=='A')++i;
    else break;
  }

  if(i==9 && j==n)cout<<"YES"<<endl;
  else cout<<"NO"<<endl;
}
