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<iostream>
#include<string>
using namespace std;
char f[256];
int main()
{
	 string s,a;
	 f['b']='d';
	 f['d']='b';
	 f['p']='q';
	 f['q']='p';
	 cin>>s;
	 for(int i=s.length()-1;i>=0;i--)
		 a=a+s[i];
	 //cout<<a<<endl;
	 for(int i=0;i<s.length();i++)
		 a[i]=f[a[i]];
	 if(a==s) cout<<"Yes";
		   else cout<<"No";
}