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
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std ;

const char *STR="AKIHABARA";
string s;

int main(){
	cin>>s;
	if (s=="AKIHABARA"||
		s=="KIHABARA" ||
		s=="AKIHBARA" ||
		s=="AKIHABRA" ||
		s=="AKIHABAR" ||
		s=="KIHBARA" ||
		s=="KIHABRA" ||
		s=="KIHABAR" ||
		s=="AKIHBRA" ||
		s=="AKIHBAR" ||
		s=="AKIHABR" ||
		s=="KIHBRA" ||
		s=="KIHBAR" ||
		s=="KIHABR" ||
		s=="AKIHBR" ||
		s=="KIHBR") puts("YES") ;
	else puts("NO");
	return 0 ;
}