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
        s1,x:array[1..100000]of char;
        s:string;
        i,j:longint;
        ch:char;
begin
        readln(s); 
        for i:=length(s) downto 1 do
        begin
                inc(j);
                ch:=s[i];
                x[j]:=ch;
        end;
        s1:=x;
        for i:=1 to length(s) do
        begin
                if s1[i]='b' then s1[i]:='d'
                else if s1[i]='d' then s1[i]:='b'
                else if s1[i]='p' then s1[i]:='q'
                else if s1[i]='q' then s1[i]:='p';
        end;
        for i:=1 to length(s) do
                if s[i]<>s1[i] then
                begin
                        writeln('No');
                        halt;
                end;
        writeln('Yes')
end.