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>
#include <algorithm>
using namespace std;
int main(void){
    
    string S;
    cin >> S;
    string T = "AKIHABARA";
    int ptr = 0;
    string ans = "YES";
    for(int i = 0; i < T.size(); i++){
        //cout << T[i] << " "<< S[ptr] << endl;
        
        
        if(T[i] == S[ptr])ptr++;
        else if(T[i] == 'A') continue;
        else ans = "NO";
        
        
    }
    
    if(ptr != S.size())ans = "NO";
    
    cout << ans << endl;
    
}
