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();
    String key = "AKIHABARA";
    int s = 0;
    int k = 0;
    boolean ans = true;
    while (k < key.length()) {
      if( s >= S.length()
         || (S.charAt(s) != key.charAt(k))) {
        if (key.charAt(k) != 'A') {
          ans = false;
          break;
        }
      } else {
        s++;
      }
      k++;
    }
    System.out.println(s == S.length() && ans ? "YES" : "NO");
  }
}