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
def bi(x):
    o = [0]*4
    for i in range(4):
        o[i] = ['A',''][x % 2]
        x //= 2
    return o

S = input()
for i in range(64):
    o = bi(i)
    if S == ''.join([o[0],'KIH',o[1],'B',o[2],'R',o[3]]):
        print("YES")
        exit()

print("NO")