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<cstdio>
#include<cstring>
#include<cstdlib>
#include<string>

using namespace std;

char ch[100];
char ch2[100];

string AKIBA = "AKIHABARA$";

void no(){
	printf("NO\n");
	exit(0);
}

int id;
void add(char c){
	if(c == AKIBA[id]){
		id++;
	}else if(AKIBA[id] == 'A'){
		id++;
		add(c);
	}else{
		no();
	}
}

int main(){
	scanf("%s", ch);
	int N = strlen(ch);
	for(int i = 0; i < N; ++i){
		add(ch[i]);
	}
	add('$');
	if(id == AKIBA.size()){
		printf("YES\n");
	}else{
		no();
	}
	return 0;
}
