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;cin >> s;
  vector<string> sa(16);
  for (int i=0;i<16;i++) {
    string x="";
	if (i & 8) x+='A';
	x+="KIH";
	if (i & 4) x+='A';
	x+='B';
	if (i & 2) x+='A';
	x+='R';
	if (i & 1) x+='A';
	sa[i]=x;
  }
  long long r=0;
  for (int i=0;i<16;i++) if (s==sa[i]) r=1;
  if (r) cout << "YES" << endl;
  else cout << "NO" << endl;
  
  
  
}