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 <cstdio>
#define NO return puts("NO")*0
using namespace std;

string s;
int main() {
	cin >> s;
	int i=0;
	if(s[i]=='A') i++;
	if(s[i]=='K') i++; else NO;
	if(s[i]=='I') i++; else NO;
	if(s[i]=='H') i++; else NO;
	if(s[i]=='A') i++;
	if(s[i]=='B') i++; else NO;
	if(s[i]=='A') i++;
	if(s[i]=='R') i++; else NO;
	if(s[i]=='A') i++;
	puts(i==s.size() ? "YES" : "NO");
	return 0;
}