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 f(string a, string b) {
	auto it = a.begin();
	for (char c : b) {
		if (it != a.end() && *it == c) {
			it++;
		}
	}
	return it == a.end();
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	string s;
	cin >> s;
	if (f("KIHBR", s) && f(s, "AKIHABARA")) {
		cout << "YES" << '\n';
	} else {
		cout << "NO" << '\n';
	}
}
