Problem:
Score : 100 points

Problem 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:

Reverse the order of the characters in S.

Replace each occurrence of b by d, d by b, p by q, and q by p, simultaneously.

Constraints

1 \leq |S| \leq 10^5

S consists of letters b, d, p, and q.

Input

The input is given from Standard Input in the following format:

S

Output

If S is a mirror string, print Yes. Otherwise, print No.

Sample Input 1

pdbq

Sample Output 1

Yes

Sample Input 2

ppqb

Sample Output 2

No

Solution in Pascal (FPC 2.6.2) (judge verdict: Accepted)

var i,j,k:longint;
    first,last:string;
    ch:array[char]of char;
begin
  readln(first);
  last:=first;
  for i:=1 to length(last) do
  last[i]:=first[length(first)-i+1];
  ch['p']:='q';
  ch['q']:='p';
  ch['b']:='d';
  ch['d']:='b';
  for i:=1 to length(last) do
  last[i]:=ch[last[i]];
  if first=last then write('Yes') else write('No');
end.