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
import java.util.Scanner;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] str = sc.next().split("");
        boolean flg = true;
        int count = 0;
        String[] akiba = { "A", "K", "I", "H", "A", "B", "A", "R", "A" };
        int i = 0;
        for (; i < akiba.length; i++) {
            if (count < str.length) {
                if (akiba[i].equals(str[count])) {
                    count++;
                } else if (akiba[i].equals("A") && i != 8) {
                } else {
                    flg = false;
                    break;
                }
            } else if (i == 8) {
                break;
            } else {
                flg = false;
                break;
            }
        }

        if (i < str.length)

        {
            flg = false;
        }
        System.out.println(flg ? "YES" : "NO");
    }

}
