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);
        
        String S = sc.next();
        sc.close();
    
        if(S.equals("AKIHABARA") || S.equals("KIHABARA") ||
            S.equals("AKIHBARA") || S.equals("AKIHABRA") ||
            S.equals("AKIHABAR") || S.equals("KIHBARA") ||
            S.equals("KIHABRA") || S.equals("KIHABAR") ||
            S.equals("AKIHBRA") || S.equals("AKIHBAR") ||
            S.equals("AKIHABR") || S.equals("KIHBRA") ||
            S.equals("AKIHBR") || S.equals("KIHABR") ||
            S.equals("KIHBAR") || S.equals("KIHBR"))
            System.out.println("YES");
        else
            System.out.println("NO");
    }
}