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:longint;
  s,c:ansistring;
  t:char;
begin
  readln(s);
  c:=s;
  for i:=1 to length(c) div 2 do
   begin
     t:=c[i];
     c[i]:=c[length(c)-i+1];
     c[length(c)-i+1]:=t;
   end;
  for i:=1 to length(c) do
   begin
     if c[i]='b' then begin c[i]:='d';continue; end;
     if c[i]='d' then begin c[i]:='b';continue; end;
     if c[i]='p' then begin c[i]:='q';continue; end;
     if c[i]='q' then begin c[i]:='p';continue; end;
   end;
  if s=c then writeln('Yes')
         else writeln('No');
end.