output_description: If S is a mirror string, print `Yes`. Otherwise, print `No`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      S
attempt: b = "b"
  d = "d"
  p = "p"
  q = "q"
  m = [(b, d), (p, q), (d, b), (q, p)]
  ans = "Yes"
  s = input()
  if len(s) % 2 == 1:
      ans = "No"
  else:
      A = s[: len(s) // 2]
      B = s[len(s) // 2 :]
      B = B[::-1]
      for i in range(len(s) // 2):
          if (A[i], B[i]) in m:
              continue
          else:
              ans = "NO"
  print(ans)
  
problem_description: Statement
  
  You are given a string S consisting of letters `b`, `d`, `p` and `q`.
  Determine whether S is a _mirror string_.
  
  Here, a mirror string is a string S such that the following sequence of
  operations on S results in the same string S:
  
    1. Reverse the order of the characters in S.
  
    2. Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously.
samples: [{"input": "pdbq", "output": "Yes\n    \n\n* * *"}, {"input": "ppqb", "output": "No"}]