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 <algorithm>
#include <cstring>
using namespace std;

int main()
{
	int ans = 1;
	char col[] = { "AKIHABARA" };
	char s[51];
	int len, clen, cnt = 0;

	cin >> s;
	len = strlen(s);
	clen = strlen(col);


	for (int i = 0; i < clen; i++){
		if (col[i] == 'A'&&col[i] != s[i - cnt])
			cnt++;
		else if (col[i] != s[i - cnt])
			ans = 0;
	}

	if ((len + cnt) > clen)
		ans = 0;

	if (ans == 0)
		cout << "NO\n";
	else
		cout << "YES\n";
	return 0;
}