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;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007

int main() {
	string s,t;
	cin>>s;
	t="AKIHABARA";
	for(int i=0;i<t.size();i++){
		if(s.size()>9){
			cout << "NO";
			return 0;
		}
		if(s[i]!=t[i]){
			s.insert(s.begin()+i,'A');
			i--;
		}
	}
	cout << "YES";
	// your code goes here
	return 0;
}