{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ consisting of letters `b`, `d`, `p` and `q`. Determine whether $S$ is a _mirror string_.\nHere, a mirror string is a string $S$ such that the following sequence of operations on $S$ results in the same string $S$:\n\n1.  Reverse the order of the characters in $S$.\n    \n2.  Replace each occurrence of `b` by `d`, `d` by `b`, `p` by `q`, and `q` by `p`, simultaneously."},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 10^5$\n*   $S$ consists of letters `b`, `d`, `p`, and `q`."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"pdbq"},{"iden":"sample output 1","content":"Yes"},{"iden":"sample input 2","content":"ppqb"},{"iden":"sample output 2","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}