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>

using namespace std;

string str[100] = { "KIHBR","AKIHBR","KIHABR","KIHBAR","KIHBRA","AKIHABR",
"AKIHBAR","AKIHBRA","KIHABAR","KIHABRA","KIHBARA",
"AKIHABAR","AKIHABRA","AKIHBARA","KIHABARA","AKIHABARA" }, s;//表和输入的字符串

int main()
{
    ios::sync_with_stdio(false);//加速
    cin >> s;//输入s
    for (int i = 0; i < 16; i++)//一共十六种可能，分别存在str[0]~str[15]中
        if (s == str[i])//如果匹配上了
            return cout << "YES\n", 0;//输出能并直接return 0
    cout << "NO\n";//如果没输出YES就是不匹配，输出NO
    return 0;
}