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 <iostream>
#include <string>
using namespace std;
int main() {
	string s;
	cin>>s;
	if (s.size()<5) return puts("NO"),0;
	int pos = s.find("KIH");
	if (pos<0||pos>1) return puts("NO"),0;
	if (pos==0) s.insert(0,"A");
	pos = s.find("B");
	if (pos<0||pos!=5&&pos!=4) return puts("NO"),0;
	if (pos==4) s.insert(4,"A");
	pos = s.find("R");
	if (pos<0||pos!=7&&pos!=6) return puts("NO"),0;
	if (pos==6) s.insert(6,"A");
	if (s.back()!='A') s.push_back('A');
	puts(s=="AKIHABARA"?"YES":"NO");
}





