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
/*Lucky_Glass*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const string goal="AKIHABARA";
int main()
{
	string str;
	cin>>str;
	int len=str.length();
	bool right=true;
	int i=0,j=0;
	for(;i<len && j<9;)
	{
		if(str[i]==goal[j]) {i++,j++;continue;}
		if(goal[j]=='A') {j++;continue;}
		right=false;
		break;
	}
	while(j<9 && goal[j]=='A') j++;
	if(i<len || j<9) right=false;
	printf("%s\n",right? "YES":"NO");
	return 0;
}
