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 {
  private static final char[] PATTERN = "AKIHABARA".toCharArray();

  public static boolean solve(char[] cs) {
    int patternIndex = 0;
    int csIndex = 0;
    while (csIndex < cs.length && patternIndex < PATTERN.length) {
      char c1 = cs[csIndex];
      char c2 = PATTERN[patternIndex];
      if (c1 == c2) {
        csIndex++;
        patternIndex++;
      } else if (c2 == 'A') {
        patternIndex++;
      } else {
        return false;
      }
    }
    return csIndex >= cs.length && patternIndex >= PATTERN.length - 1;
  }

  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    char[] cs = scanner.next().toCharArray();
    System.out.println(solve(cs) ? "YES" : "NO");
  }
}
