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;
#define MOD 1000000007


int main() {
  
  string S;
  cin >> S;

  for(int bit = 0;bit < (1<<4);bit++) {
    string a="",b="",c="",d="";
    if(bit&1) a = "A";
    if(bit>>1&1) b = "A";
    if(bit>>2&1) c = "A";
    if(bit>>3&1) d = "A";
    string s = a+"KIH"+b+'B'+c+'R'+d;
    if(S == s) {
      cout << "YES" << endl;
      return 0;
    }
  }

  cout << "NO" << endl;
  
}