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;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		if ("AKIHABARA".equals(s) || "KIHABARA".equals(s) || "AKIHBARA".equals(s) || "AKIHABRA".equals(s)
				|| "AKIHABAR".equals(s) || "KIHBARA".equals(s) || "KIHABRA".equals(s) || "KIHABAR".equals(s)
				|| "AKIHBRA".equals(s) || "AKIHBAR".equals(s) || "AKIHABR".equals(s) || "AKIHBR".equals(s)
				|| "KIHABR".equals(s) || "KIHBRA".equals(s) || "KIHBAR".equals(s)|| "KIHBR".equals(s)) {
			System.out.println("YES");
		} else {
			System.out.println("NO");
		}
	}
}