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<stdio.h>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
string s = "AKIHABARA";
string mok;
void dfs(string t, int x)
{
	if (x == 9)
	{
		if (t == mok)
		{
			printf("YES\n");
			exit(0);
		}
		return;
	}
	if (s[x] == 'A')dfs(t, x + 1);
	t.push_back(s[x]);
	dfs(t, x + 1);
}
int main()
{
	cin >> mok;
	dfs("", 0);
	printf("NO\n");
}