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;
  cin >> s;
  int ans=0;
  
  for(int i=0;i<16;i++){
    string t;
    if(i%2) t+='A';
    t+="KIH";
    if(i/2%2) t+='A';
    t+='B';
    if(i/4%2) t+='A';
    t+='R';
    if(i/8%2) t+='A';
    
    if(s==t) ans++;
  }
  
  if(ans) cout << "YES" << endl;
  else cout << "NO" << endl;
}