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 <iostream>
#include <string>
using namespace std;
int main(){
	string ans = "AKIHABARA";
	string check = "KIHBR";
	string str;
	int i = -1,pos;
	cin >> str;
	if(str.length() < ans.length() && str.find("KIH") != -1){
		while((pos = str.find('A')) != -1){
			if(i == pos)
				break;
			str.erase(str.begin() + pos);
			i = pos;
		}
		if(str == check)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}else{
		if(str == ans)
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
}