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>
#define ll long long
#define reg register
using namespace std;
string s;
map<char,int>a;
int main()
{
    a['p']=1;
	a['d']=2;
	a['q']=3;
	cin>>s;
	s=" "+s; 
    for(reg int l=s.length()-1,i=1;i<=(l>>1)+1;i++)
	if(a[s[i]]^((a[s[l-i+1]]+2)%4))return puts("No"),0;
    return puts("Yes"),0;
}