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>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
  string s;
  cin >> s;
  bool p = false;
  rep(bit, 1<<4) {
    string t;
    if (bit & 1<<0) t += "A";
    t += "KIH";
    if (bit & 1<<1) t += "A";
    t += "B";
    if (bit & 1<<2) t += "A";
    t += "R";
    if (bit & 1<<3) t += "A";
    if (s == t) p = true;
  }
  if (p) cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}