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 Ruby (2.3.3) (judge verdict: Accepted)

table = {
  'b' => 'd',
  'd' => 'b',
  'p' => 'q',
  'q' => 'p'
}
s = gets.chomp
m = s.each_char.reverse_each.map {|c| table[c] }.join('')
puts (s == m) ? 'Yes' : 'No'