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 s,s1="AKIHABARA";
int e;
int main(){
	cin>>s;
	if(s.size()-1>8){
		printf("NO");
		return 0;
	}
	for(int i=0;i<s.size();i++){
		if(s[i]==s1[e])e++;
		else{
			if(s1[e]=='A'){
				e++;
				i--;
			}
			else{
				printf("NO");
				return 0;
			}
		}
	}
	if(e<=7){
		printf("NO\n");
	}
	else printf("YES\n");
	return 0;
}