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 <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;

signed main(void)
{
	string s;
	int a[4];

	a[0] = 0;
	a[1] = 4;
	a[2] = 6;
	a[3] = 8;
	cin >> s;
	rep(i, 4) 
	{
		if (s.size() >= a[i])
		{
			if (s[a[i]] == 'A')
				continue;
			else
				s.insert(s.begin() + a[i], 'A');
		}
	}
	if (s == "AKIHABARA")
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
	return 0;
}
