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(void) {
	string b, s = "";
	int i;
	cin >> b;
	if (b.size() < 10) {
		for (i = 0; i < b.size(); i++) {
			if (b[i] == 'A') {
				if (i < b.size() - 1 && b[i + 1] == 'A')
					s += "A";
			}
			else if (i < b.size() - 2 && b[i] == 'K' && b[i + 1] == 'I' && b[i + 2] == 'H') {
				s += "!";
				i += 2;
			}
			else {
				s = s + b[i];
			}
		}
		if (s == "!BR") {
			printf("YES\n");
			return 0;
		}
	}
	printf("NO\n");
	return 0;
}