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
# A - AKIBA
substring = ['', 'KIH', 'B', 'R']
akihabara = []

for i in range(16):
	b = format(i, 'b')
	bin_str = b.zfill(4)
	s = ''

	for j in range(4):
		s += substring[j]
		
		if bin_str[j] == '1':
			s += 'A'

	akihabara.append(s)

if input() in akihabara:
	print('YES')
else:
	print('NO')