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<cstdio>
#include<algorithm>
char p[100], q[100] = "AKIHABARA";
int main() {
	int i, pv = 0;
	scanf("%s", p);
	for (i = 0; q[i]; i++) {
		if (q[i] == p[pv]) {
			pv++;
		}
		else if(q[i] != 'A'){
			puts("NO");
			return 0;
		}
	}
	if (!p[pv])puts("YES");
	else puts("NO");
}