{"problem":{"name":"Mirror String","description":{"content":"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","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"relay_b"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\leq |S| \\leq 10^5$\n*   $S$ consists of letters `b`, `d`, `p`, and `q`.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"relay_b","tags":[],"sample_group":[["pdbq","Yes"],["ppqb","No"]],"created_at":"2026-03-03 11:01:13"}}