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,b;
int main()
{
	cin>>a;
	for(int s=a.size()-1;s>=0;s--)
	b=b+a[s];
	for(int s=0;s<b.size();s++)
	{
		switch(b[s])
		{
			case 'p':b[s]='q';break;
			case 'q':b[s]='p';break;
			case 'b':b[s]='d';break;
			case 'd':b[s]='b';break;
		}
	}
	if(b==a)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}
