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<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main() {
	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	string a;
	cin>>a;

	if(a == "KIHBR" || a == "KIHBRA" || a == "KIHBAR" || a == "KIHBARA" || a == "KIHABR" || a == "KIHABRA" || a == "KIHABAR" || a == "KIHABARA" || a == "AKIHBR" || a == "AKIHBRA" || a == "AKIHBAR" || a == "AKIHBARA" || a == "AKIHABR" || a == "AKIHABRA" || a == "AKIHABAR" || a == "AKIHABARA") cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	
}