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