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
s = input()
n = 4

#AKIHABARAのAの箇所は4か所。それをbit全探索で一致するパターンがあるか判定
for i in range(2**n):
    tmp = ['','','','']
    for j in range(n):
        if ((i>>j)&1):
            tmp[j]='A'
    t = '{0[0]}KIH{0[1]}B{0[2]}R{0[3]}'.format(tmp) 
    if t==s:
        print('YES');exit()
print('NO')