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 <cmath>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
string A="AKIHABARA";
string B;
int flag=0;
void dfs(int k1,string k2){
	if (k1==A.length()){
		if (k2==B) flag=1; return;
	}
	dfs(k1+1,k2+A[k1]);
	if (A[k1]=='A') dfs(k1+1,k2);
}
int main(){
	cin>>B;
	dfs(0,"");
	if (flag) cout<<"YES"<<endl; else cout<<"NO"<<endl;
}