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: need = ["K", "I", "H", "B", "R"]
  noneed = [
      "C",
      "D",
      "E",
      "F",
      "G",
      "J",
      "L",
      "M",
      "N",
      "O",
      "P",
      "Q",
      "S",
      "T",
      "U",
      "V",
      "W",
      "X",
      "Y",
      "Z",
  ]
  s = "KIHBRC"
  
  
  def judge(s: str) -> bool:
      pos = [0] * 5
      for i, c in enumerate(need):
          if s.count(c) != 1:
              return False
          else:
              pos[i] = s.index(c)
  
      for c in noneed:
          if s.count(c) != 0:
              return False
  
      if pos[0] > 2:
          return False
  
      if pos[1] - pos[0] > 1:
          return False
  
      if pos[2] - pos[1] > 1:
          return False
  
      if pos[3] - pos[2] > 2:
          return False
  
      if pos[4] - pos[3] > 2:
          return False
  
      if len(s) - pos[4] > 2:
          return False
  
      return True
  
  
  print(judge(s))
  
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"}]