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;
bool subset(string big , string small){
	int ptr = 0;
	for(char c : small){
		while(ptr < big.size() && big[ptr] != c){
			++ptr;
		}
		if(ptr == big.size()){
			return 0;
		}
		++ptr;
	}
	return 1;
}
int main(){
	string str;
	cin >> str;
	if(subset("AKIHABARA" , str) && subset(str , "KIHBR")){
		cout << "YES\n";
	}
	else{
		cout << "NO\n";
	}
}