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
#!/usr/bin/env python3
def solve(s):
    i = 0
    for c in 'AKIHABARA':
        if i < len(s) and c == s[i]:
            i += 1
        elif c == 'A':
            pass
        else:
            return False
    if i != len(s):
        return False
    return True
print(['NO', 'YES'][solve(input())])
