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

  int i{}, j{}, n = S.size();
  while (i < n || j < (int)A.size()) {
    if (S[i] == A[j]) ++i, ++j;
    else if (A[j] == 'A') ++j;
    else break;
  }

  cout << (i == n && j > 7 ? "YES" : "NO") << endl;
}
