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;
string a,yl="AKIHABARA";
int now,k;
int main()
{
	cin>>a;
	for(int s=0;s<a.size();s++)
	{
		if(a[s]==yl[now])
		{
			now++;
		}
		else
		{
			if(s>0)
			if(a[s]==a[s-1])
			{
				cout<<"NO"<<endl;
				exit(0);
			}
			if(yl[now]=='A')now++,s--;
			else
			{
				cout<<"NO"<<endl;
				exit(0);
			}
		}
	}
	k=a.size();
	for(int s=0;s<a.size();s++)
	{
		if(a[s]=='A')k--;
	}
	if(k==5)
	cout<<"YES"<<endl;
	else
	cout<<"NO"<<endl;
}