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
#include <bits/stdc++.h>
 
using namespace std;
 
int main() {
  string s;
  cin >> s;
  string need = "AKIHABARA";
  int ptr = 0;
  for (int i = 0; i < 9; i++) {
    if (ptr < (int) s.length() && need[i] == s[ptr]) {
      ptr++;
    } else {
      if (need[i] != 'A') {
        puts("NO");
        return 0;
      }
    }
  }
  if (ptr != (int) s.length()) {
    puts("NO");
    return 0;
  }
  puts("YES");
  return 0;
}