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.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

        StringBuilder s = new StringBuilder(sc.next());
        if(s.charAt(0) != 'A'){
            s.insert(0, 'A');
        }
        int index = s.indexOf("HB");
        if(index != -1){
            s.insert(index + 1, "A");
        }
        index = s.indexOf("BR");
        if(index != -1){
            s.insert(index + 1, "A");
        }
        if(s.charAt(s.length() - 1) != 'A'){
            s.insert(s.length(), 'A');
        }

        System.out.println(s.toString().equals("AKIHABARA") ? "YES" : "NO");

    }
}
