#cf17finala. [cf17_final_a]AKIBA

[cf17_final_a]AKIBA

Problem Statement

You are given a string SS.

Takahashi can insert the character A at any position in this string any number of times.

Can he change SS into AKIHABARA?

Constraints

  • 1leqSleq501 \\leq |S| \\leq 50
  • SS consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

SS

Output

If it is possible to change SS into AKIHABARA, print YES; otherwise, print NO.


Sample Input 1

KIHBR

Sample Output 1

YES

Insert one A at each of the four positions: the beginning, immediately after H, immediately after B and the end.


Sample Input 2

AKIBAHARA

Sample Output 2

NO

The correct spell is AKIHABARA.


Sample Input 3

AAKIAHBAARA

Sample Output 3

NO