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()
{
  char s[100];
  scanf("%s",s);
  char t[]="AKIHABARA";
  bool F=1;
  int i,j;
  for(i=0,j=0;s[i]||t[j];){
    if(s[i]==t[j]){
      i++;
      j++;
    }
    else if(t[j]=='A'){
      j++;
    }
    else{
      F=0;
      break;
    }
  }
  puts(F&&!s[i]&&!t[j]?"YES":"NO");
  return 0;
}