Problem Description

Given a string $ S $.

Takahashi can insert any number of characters A at any position in the string.

Can $ S $ be transformed into AKIHABARA?

Input Format

The input is given from the standard input in the following format:

$ S $

Output Format

Output YES if $ S $ can be transformed into AKIHABARA, otherwise output NO.

Sample Input and Output

Sample Input #1

KIHBR

Sample Output #1

YES

Sample Input #2

AKIBAHARA

Sample Output #2

NO

Sample Input #3

AAKIAHBAARA

Sample Output #3

NO

Notes/Hints

Constraints

• $1 \leq |S| \leq 50$
• $ S $ consists only of uppercase alphabetic characters.

Sample Explanation 1

It is sufficient to insert one A at the beginning, right after H, right after B, and at the end.

Sample Explanation 2

AKIHABARA is the correct spelling.

见题面 Input 部分

见题面 Output 部分