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>
using namespace std;
string A = "AKIHABARA";
int I[]{8,6,4,0};
int main() {
  string S;
  cin >> S;
  bool flag{0};
  for (int i = 0, n = 1 << 4; i != n; ++i) {
    string B{A};
    int j = i, k{};
    while(j) {
      if (j&1) B.erase(I[k],1);
      ++k, j >>= 1;
    }
    if (S == B) {
      flag = 1;
      break;
    }
  }
  cout << (flag ? "YES" : "NO") << endl;
}
