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<cstdio>
#include<string>
using namespace std;
char a[100005];
string s,s2,s3;
int main()
{
	scanf("%s",&a);
	s=a;
	for (int j=0;j<=s.size()-1;j++)
	{
		if(s[j]=='b')
		s2+='d';
		if(s[j]=='d')
		s2+='b';
		if(s[j]=='p')
		s2+='q';
		if(s[j]=='q')
		s2+='p';
	}
	for (int j=s2.size()-1;j>=0;j--)
	{
		s3+=s2[j];
	}
	if(s3==s)
	printf("Yes");
	else printf("No");
}