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 <iostream>
#include <string>
using namespace std;
int main(void){
  int i;
  string s,sa[16]={"KIHBR","AKIHBR","KIHABR","AKIHABR","KIHBAR","AKIHBAR","KIHABAR",
                   "AKIHABAR","KIHBRA","AKIHBRA","KIHABRA","AKIHABRA","KIHBARA",
                   "AKIHBARA","KIHABARA","AKIHABARA"};
  cin >> s;
  for (i=0;i<16;i++) if (s==sa[i]) break;
  if (i==16) cout << "NO" << endl;
  else cout << "YES" << endl;
  return 0;
}