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() {
  string S;
  cin >> S;

  for (int i = 0; i < 1 << 4; ++i) {
    string T;
    for (int j = 0; j < 4; ++j) {
      if (i & 1 << j)
        T += 'A';
      if (j == 0)
        T += "KIH";
      if (j == 1)
        T += 'B';
      if (j == 2)
        T += 'R';
    }

    if (S == T) {
      cout << "YES" << endl;
      return 0;
    }
  }

  cout << "NO" << endl;
}