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,base="AKIHABARA"; cin>>s;
  if(s.size()>base.size()){
    cout<<"NO"<<endl;
    return 0;
  }string renew="";
  int now=0;
  for(int i=0;i<s.size();i++){
    if(s[i]!=base[now] && base[now]=='A'){
      renew+='A';
      renew+=s[i];
      now++;
    }else{
      renew+=s[i];
    }
    now++;
  }
  if(now==8){
    renew+='A';
  }
  if(renew==base){
    cout<<"YES"<<endl;
  }else{
    cout<<"NO"<<endl;
  }
}