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
s=list(input())
n=len(s)
if n%2==1:
    print('No')
else:
    k=n//2
    for i in range(k):
        if s[i]=='b' and not s[n-1-i]=='d':
            print('No')
            exit()
        if s[i]=='d' and not s[n-i-1]=='b':
            print('No')
            exit()   
        if s[i]=='p' and not s[n-1-i]=='q':
            print('No')
            exit()
        if s[i]=='q' and not s[n-i-1]=='p':
            print('No')
            exit() 
    print('Yes')
        