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 a = "AKIHABARA";
  int p[] = {0, 4, 6, 8};

  for (int i = 0; i < (1 << 4); ++i) {
    string t = a;
    for (int j = 3; j >= 0; --j) {
      if (i & (1 << j))
        t.erase(p[j], 1);
    }
    if (s == t) {
      puts("YES");
      return 0;
    }
  }
  puts("NO");
}