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:ansistring;
  i,j,n,k,m,t:longint;
begin
  readln(s);
  k:=length(s);
  if k mod 2<>0 then
  begin
    writeln('No');
    halt;
  end;
  for i:=1 to k div 2+1 do
  begin
    t:=abs(ord(s[i])-ord(s[k-i+1]));
    if (t<>1)and(t<>2) then
    begin
      writeln('No');
      halt;
    end;
  end;
  writeln('Yes');
end.