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