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;
typedef pair<int,int> ii;

int main() {
	cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
	set<string> st={"AKIHABARA", "KIHABARA", "AKIHBARA", "KIHBARA", "AKIHABRA", "KIHABRA", "AKIHBRA", "KIHBRA", "AKIHABAR", "KIHABAR", "AKIHBAR", "KIHBAR", "AKIHABR", "KIHABR", "AKIHBR", "KIHBR"};
	string s; cin>>s;
	cout<<(st.count(s)?"YES":"NO")<<"\n";
	return 0;
}