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() {


//long long a,b;
//int *num=new int[4];
//char *s=new char[3];
string s;
cin >> s;

string list[17]={"AKIHABARA","AKIHABAR","AKIHABRA","AKIHBARA","KIHABARA","AKIHABR","AKIHBRA","KIHBARA","AKIHBAR","KIHABRA","KIHABAR","AKIHBR","KIHBRA","KIHABR","KIHBAR","KIHBR"};
int flag=0;
for(string a:list){
const char* c=s.c_str();
const char* b=a.c_str();

if(strcmp(c,b)==0){flag=1;
//cout << a << endl;

}
}
if(flag)
cout << "YES" << endl;
else
cout << "NO" << endl;


}
