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.*;

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

	static String find(String s) {
		boolean[] ft = { false, true };

		for (boolean b1: ft)
			for (boolean b2: ft)
				for (boolean b3: ft)
					for (boolean b4: ft)
						if (String.format("%sKIH%sB%sR%s", a(b1), a(b2), a(b3), a(b4)).equals(s))
							return "YES";
		return "NO";
	}

	static String a(boolean b) {
		return b ? "A" : "";
	}
}
