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) {
		String[] kai= {"KIH","B","R"};
		Scanner sc=new Scanner(System.in);
		String s=sc.next();
		for(int i=0; i<16; i++) {
			String gousei="";
			int tmp=i;
			for(int j=0; j<4; j++) {
				if(tmp%2==1) {
					gousei=gousei+"A";
				}
				if(j<3) {
					gousei=gousei+kai[j];
				}
				tmp/=2;
			}
			if(s.equals(gousei)) {
				pl("YES");
				System.exit(0);
			}
		}
		pl("NO");
	}
	public static void pl(Object o) {
		System.out.println(o);
	}
	public static void p(Object o) {
		System.out.print(o);
	}
}
