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;
int main()
{
	string s,ss;
	cin>>s;
	ss=s;
	int len=s.length();
	for(int i=0;i<len/2;i++)
		swap(s[i],s[len-i-1]);
	for(int i=0;i<len;i++)
		switch(s[i])
		{
			case'b':s[i]='d';break;
			case'd':s[i]='b';break;
			case'p':s[i]='q';break;
			case'q':s[i]='p';break;
		}
	if(ss==s)cout<<"Yes";
		else cout<<"No";
	return 0;
}