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,b="AKIHABARA";
int idx=0,pos=0;
int main(){
	cin>>s;
	if(s.size()>9){
		puts("NO");
		return 0;
	}
	while(idx!=10){
		if(b[idx]!=s[pos]){
			if(b[idx]!='A'){
				puts("NO");
				return 0;
			}
			s.insert(s.begin()+pos,'A');
		}
		idx++;
		pos++;
	}
	puts("YES");
	return 0;
}