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;
int main(){
  string s,t;
  cin >> s;
  for(int i=0;i<(1<<4);i++){
    int bit=i;
    t="";
    t+=((bit%2)?"A":"");
    bit/=2;
    t+="KIH";
    t+=((bit%2)?"A":"");
    bit/=2;
    t+="B";
    t+=((bit%2)?"A":"");
    bit/=2;
    t+="R";
    t+=((bit%2)?"A":"");
    if(s==t){
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
