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>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

bool dfs(string s){
	if(s=="AKIHABARA") return true;
	if(s.length()>=9) return false;
	rep(i,s.length()+1) if(dfs(s.substr(0,i)+"A"+s.substr(i))) return true;
	return false;
}

int main(){
	string s; cin>>s;
	puts(dfs(s)?"YES":"NO");
	return 0;
}
