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

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

		int[] ai = { 0, 4, 6, 8 };
		Arrays.stream(ai)
			.filter(i -> i < sb.length() && sb.charAt(i) != 'A' || i == sb.length())
			.forEach(i -> sb.insert(i, "A"));
		System.out.println(sb.toString().equals("AKIHABARA") ? "YES" : "NO");
	}
}
