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<iostream>
#define O return cout<<"NO"<<endl,0
using namespace std;
string s;
int main()
{
  cin>>s;
  int id=0;
  if(s[id]=='A')id++;
  if(s[id]=='K')id++;
  else O;
  if(s[id]=='I')id++;
  else O;
  if(s[id]=='H')id++;
  else O;
  if(s[id]=='A')id++;
  if(s[id]=='B')id++;
  else O;
  if(s[id]=='A')id++;
  if(s[id]=='R')id++;
  else O;
  if(s[id]=='A')id++;
  if(id<s.size())O;
  cout<<"YES"<<endl;
}