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 all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;

bool func(string s){
  if (s.size() >= 9) return s == "AKIHABARA";
  for (int i = 0; i <= s.size(); i++) {
    if(func(s.substr(0, i) + 'A' + s.substr(i))) return true;
  }
  return false;
}

int main() {
  string s;
  cin >> s;
  if (func(s) == true) cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}