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
#include <bits/stdc++.h>
using namespace std;
string a,s;
int main(){
    cin >> a;
    s = a;
    reverse(a.begin(),a.end());
    for (int i = 0; i < a.size(); i++){
        if (a[i] == 'b') a[i] = 'd';
        else if (a[i] == 'd') a[i] = 'b';
        else if (a[i] == 'p') a[i] = 'q';
        else a[i] = 'p';
    }
    if (a == s)
        cout << "Yes";
    else cout << "No";
    return 0;
}