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>



using namespace std;


int main()
{
    string s, s1, s2 = "";
    s1 = "AKIHABARA";
    cin >> s;
    if (s[0] != 'A')
        s = 'A' + s;
    for (int i = 0; i < s.size(); i++)
    {
        s2 = s2 + s[i];
        if (s[i] != 'A' && (s[i + 1] == 'K' || s[i + 1] == 'B' || s[i + 1] == 'R'))
             s2 = s2 + 'A';
    }
    if (s2.back() != 'A')
        s2 += 'A';
    if (s2 == s1)
    {
        cout << "YES";
    }
    else
    {
        cout << "NO";
    }
}


