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;
const int mod = 1000000007;
int main() {
	string S,T="KIHBR";
	cin >> S;
	if(S.size()>=10){
		cout << "NO";
		return 0;
	}
	for (size_t i = 0; i < S.size(); i++)
	{
		if (S.at(i) == 'A') {
			if (i != S.size() - 1 &&S.at(i+1)!='K'&& S.at(i + 1) != 'B'&& S.at(i + 1) != 'R') {
				cout << "NO";
				return 0;
			}
			S.erase(i, 1);
		}
	}
	if (S == T)cout << "YES";
	else cout << "NO";
	
}