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

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        PrintWriter out = new PrintWriter(System.out);

        for (int i = 0; i < S.length() - 1; i++) {
            if (S.charAt(i + 1) == (S.charAt(i))) {
                out.println("NO");
                sc.close();
                out.flush();
                return;
            }
        }

        String[] s = S.split("A");
        String kihbr = "";

        for (int i = 0; i < s.length; i++) {
            kihbr += s[i];
        }

        if (kihbr.equals("KIHBR")) {
            if (S.charAt(0) == 'A') {
                if (S.charAt(2) == 'A' || S.charAt(3) == 'A') {
                    out.println("NO");
                    sc.close();
                    out.flush();
                    return;
                }
            } else {
                if (S.charAt(1) == 'A' || S.charAt(2) == 'A') {
                    out.println("NO");
                    sc.close();
                    out.flush();
                    return;
                }
            }
            out.println("YES");
        } else {
            out.println("NO");
        }

        sc.close();
        out.flush();
    }
}