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<string>
#include<iostream>
using namespace std;
int main()
{
	int i,m;
	string a,b;
	cin>>a;
	m=-1;
	b="";
	for(i=a.size()-1;i>=0;i--)
	{
		m++;
		if(a[i]=='p')
			b=b+'q';
		if(a[i]=='q')
			b=b+'p';
		if(a[i]=='b')
			b=b+'d';
		if(a[i]=='d')
			b=b+'b';
	}
	if(a==b)
		cout<<"Yes"<<endl;
	else
		cout<<"No"<<endl;
	return 0;
}