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;

char s[55];

int subsq(const char *s, const char *t){
    int n = strlen(t);
    int m = strlen(s);
    for(int i = 0, j = 0; i < n; i++){
        if(s[j] == t[i]) j++;
        if(j == m) return 1;
    }
    return 0;
}

int main(){
    scanf("%s", s);
    if(subsq(s, "AKIHABARA") && subsq("KIHBR", s)) puts("YES");
    else puts("NO");
}