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(){
	string s;
	cin>>s;
	
	string ans="AKIHABARA";
	
	int flag=1;
	if(s.size()<5||s.size()>9)flag=0;
	int j=0;
	
	for(int i=0;i<s.size();i++){
		if(s[i]==ans[j]){
			j++;
		}else if(ans[j]=='A'){
			j++;
			if(s[i]==ans[j]){
				j++;
			}else{
				//cout<<i<<" "<<j<<endl;
				flag=0;
			}
		}else{
			//cout<<i<<" "<<j<<endl;
			flag=0;
		}
	}
	if(j<ans.size()-1)flag=0;
	
	if(flag){
		cout<<"YES"<<endl;
	}else{
		cout<<"NO"<<endl;
	}
	
	return 0;
}