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;
#define long int64_t

int main() {
	ios_base::sync_with_stdio( false );

	string s;
	cin >> s;

	string t;
	for( int i = 0; i < s.size(); ++i ) {
		if( (s[i] == 'K' || s[i] == 'B' || s[i] == 'R') && (t == "" || s[i-1] != 'A') ) {
			t += 'A';
		}

		t += s[i];
	}

	if( t.back() == 'R' ) {
		t += 'A';
	}

	cout << (t == "AKIHABARA" ? "YES" : "NO") << endl;

	return 0;
}
