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 rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e9+10;

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

  int p = 0;
  int p_ref = 0;
  string ref = "AKIHABARA";
  while(!(p_ref == ref.size() && p == s.size())){
    if(s[p] == ref[p_ref]){
      p++;
      p_ref++;
    }else if(ref[p_ref] == 'A'){
      p_ref++;
    }else{
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;

  return 0;
}
