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>
#include <iostream>
using namespace std;
int l;
char s[100001],c[100001];
int main()
{
	cin>>s;
	l=strlen(s);
	for(int i=0;i<l;i++)
	{
		c[i]=s[l-i-1];
		if(c[i]=='q') c[i]='p';
		else if(c[i]=='p') c[i]='q';
		else if(c[i]=='b') c[i]='d';
		else if(c[i]=='d') c[i]='b';
		if(c[i]!=s[i])
		{
			cout<<"No";break;
		}
		if(i==l-1) cout<<"Yes";
	}
	return 0;
}