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:

1. Reverse the order of the characters in S.

2. 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`.

Examples

Input

pdbq


Output

Yes


Input

ppqb


Output

No
from sys import stdin
ans = 'Yes'
di = {}
di['b'] = 1
di['d'] = -1
di['p'] = 2
di['q'] = -2
a = stdin.readline().strip()
l = len(a)
if l%2:
 ans = 'No'
else:
 for i in xrange(l/2):
  if di[a[i]] + di[a[l-1-i]]:
   ans = 'No'
print ans