output_description: If it is possible to change S into `AKIHABARA`, print `YES`; otherwise, print
  `NO`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: S = input()
  N = len(S)
  K, I, H, B, R = S.find("K"), S.find("I"), S.find("H"), S.find("B"), S.find("R")
  print(
      "YES"
      if (K == 0 or K == 1)
      and K == I - 1 == H - 2
      and (H + 1 == B or S[H + 1] == "A")
      and (B + 1 == R or S[B + 1] == "A")
      and (R == N - 2 and S[R + 1] == "A" or R == N - 1)
      else "NO"
  )
  
problem_description: Statement
  
  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`?
samples: [{"input": "KIHBR", "output": "YES\n    \n\nInsert one `A` at each of the four positions: the beginning, immediately after\n`H`, immediately after `B` and the end.\n\n* * *"}, {"input": "AKIBAHARA", "output": "NO\n    \n\nThe correct spell is `AKIHABARA`.\n\n* * *"}, {"input": "AAKIAHBAARA", "output": "NO"}]