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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;

public class Hello
{
    public static void Main()
    {
        var s = Console.ReadLine().Trim();
        var s2 = rev(s);
        var s3 = change(s2, 'b', 'd');
        var s4 = change(s3, 'p', 'q');
        Console.WriteLine(s == s4 ? "Yes" : "No");
    }
    public static string rev(string s)
    {
        var c = s.ToCharArray();
        Array.Reverse(c);
        return new string(c);
    }
    public static string change(string s, char a, char b)
    {
        var s2 = s.Replace(a, '*');
        var s3 = s2.Replace(b, '?');
        s2 = s3.Replace('*', b);
        return s2.Replace('?', a);
    }
}