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
# -*- coding:utf-8 -*-
import sys
S = list(input())
a = list(reversed(S))
for tmp in range(len(a)):
    if a[tmp] == 'b':
        a[tmp] = 'd'
    elif a[tmp] == 'd':
        a[tmp] = 'b'
    elif a[tmp] == 'p':
        a[tmp] = 'q'
    else:
        a[tmp] = 'p'

    if S[tmp] != a[tmp]:
        print("No")
        sys.exit()

print("Yes")