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
import java.util.*;
import java.io.*;

import static java.lang.System.in;

public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        String ans = help(s)?"YES":"NO";
        System.out.println(ans);
    }
    static boolean help(String s){
        String t = s.replace("A","");
        if(!t.equals("KIHBR")) return false;
        int[] rec = new int[5];
        int k=0;
        for(int i=0;i<s.length();i++){
            if(s.charAt(i)!='A') rec[k++]=i;
        }
        return rec[0]<=1&&(rec[1]-rec[0]==1)&&(rec[2]-rec[1]==1)&&(rec[3]-rec[2]<=2)&&(rec[4]-rec[3]<=2)&&(s.length()-1-rec[4]<=1);
    }
}
