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;
string S, T = "AKIHABARA"; int cx = 0, a[4] = { 0,4,6,8 }; bool used[10];
int main() {
	cin >> S;
	for (int i = 0; i < 16; i++) {
		string U = "";
		for (int j = 0; j < 9; j++)used[j] = false;
		for (int j = 0; j < 4; j++) { if ((i / (1 << j)) % 2 == 1)used[a[j]] = true; }
		for (int j = 0; j < 9; j++) {
			if (used[j] == false)U += T[j];
		}
		if (S == U) { cout << "YES" << endl; return 0; }
	}
	cout << "NO" << endl;
	return 0;
}