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<string>

using namespace std;

int main(){ string S; cin >> S;
 if( S == "KIHBR" || S =="AKIHBR" || S == "KIHABR" || S == "KIHBAR" || S == "KIHBRA" || S == "AKIHABR" || S == "AKIHBAR" || S == "AKIHBRA" || S == "KIHABAR" || S == "KIHABRA" || S == "KIHBARA" || S == "AKIHABAR" || S == "AKIHABRA" || S == "AKIHBARA" || S == "KIHABARA" || S == "AKIHABARA"){ cout << "YES" << endl;}
           else{cout << "NO" << endl;}
           return 0;}