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;

string tar = "AKIHABARA";
string s;

int main(){
	cin >> s;
	bool yes = 1;
	int idx = 0;
	for(int i=0;i<s.size();i++){
		if(s[i] == tar[idx]){
			idx++;
		} else if(tar[idx] == 'A' && idx+1<tar.size() && s[i] == tar[idx+1]){
			idx+=2;
		} else {
			yes = 0;
		}
	}
	if(yes && idx >= tar.size()-1) printf("YES\n");
	else printf("NO\n");
  return 0;
}
