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<cstring>
using namespace std;
char s[111111];
char s1[111111];
int l;
int main()
{
	gets(s);
	l=strlen(s);
	for(int i=0;i<l;++i)
	{
		switch(s[l-i-1])
		{
			case 'b':s1[i]='d';break;
			case 'd':s1[i]='b';break;
			case 'p':s1[i]='q';break;
			case 'q':s1[i]='p';break;
		}
	}
	if(strcmp(s,s1))printf("No");
	else printf("Yes");
	return 0;
}