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)

{AT2201}
var
s1,s2:ansistring;
i:longint;
t:char;
begin
readln(s1);
s2:=s1;
for i:=1 to length(s2) div 2 do
begin
t:=s2[i];
s2[i]:=s2[length(s2)-i+1];
s2[length(s2)-i+1]:=t;
end;
for i:=1 to length(s2) do
 if (s2[i]='b') and (s1[i]<>'d') or (s2[i]='d') and (s1[i]<>'b') or (s2[i]='p') and (s1[i]<>'q') or (s2[i]='q') and (s1[i]<>'p') then
 begin
 writeln('No');
 halt;
 end;
writeln('Yes');
end.