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 Python (3.4.3) (judge verdict: Accepted)

# -*- coding: utf-8 -*-


def main():
    s = input()
    t = ''

    for si in s[::-1]:
        if si == 'b':
            t += 'd'
        elif si == 'd':
            t += 'b'
        elif si == 'p':
            t += 'q'
        elif si == 'q':
            t += 'p'

    if s == t:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()