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()
{
	int head=0,tail=0;
	string cmp="AKIHABARA";
	string get;
	cin>>get;
	while(head<9)
	{
		if(cmp[head]!=get[tail]&&cmp[head]=='A')
			head++;
		else if(cmp[head]!=get[tail]&&cmp[head]!='A')
		{
			cout<<"NO"<<endl;
			return 0;
		}
		else
		{
			head++;
			tail++;
		}
	}
	if(tail>get.size()-1)
	    cout<<"YES"<<endl;
	else
	    cout<<"NO"<<endl;
	return 0;
}
