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;
int main()
{
	string s1,s2;	
	int len,i;
	cin>>s1;
	len=s1.size();
	for(i=len-1;i>=0;i--)
	{
		switch(s1[i])
		{
			case 'b':s2+='d';break;
			case 'd':s2+='b';break;
			case 'q':s2+='p';break;
			case 'p':s2+='q';break;
			default: s2+=s1[i];
		}
	}
//	cout<<s1<<endl<<s2;	
	if(s1==s2) cout<<"Yes\n";
	else cout<<"No\n";
	return 0;
}