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;
  string key[16];
  string consist[] = {"KIH", "B", "R"};
  for (int i = 0; i < 1 << 4; i ++) {
    int i_ = i;
    string kj = "";
    for (int j = 0; j < 4; j ++) {
      if (i_ % 2) kj += "A";
      i_ /= 2;
      if (j < 3) kj += consist[j];
    }
    key[i] = kj;
  }
  for (int i = 0; i < 16; i ++) {
    if (S == key[i]) {
      cout << "YES" << endl;
      return 0;
    }
    //cout << key[i] << endl;
  }
  cout << "NO" << endl;
}
