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>
typedef long long ll;

using namespace std;


const int VMAX = 10;

int dist[VMAX][VMAX];
signed main() {
  string s;
  cin >> s;
  regex re("^A?KIHA?BA?RA?$");
  smatch match;
  if (regex_match(s, match, re)) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
