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<bits/stdc++.h>
using namespace std;
int main()
{
	string n,m;
	cin>>n;
	m=n;
	for(int i=0;i<n.length();++i){
		switch(m[n.length()-i-1]){
			case 'b':m[n.length()-i-1]='d';break;
			case 'd':m[n.length()-i-1]='b';break;
			case 'p':m[n.length()-i-1]='q';break;
			case 'q':m[n.length()-i-1]='p';break;
		}
		if(m[n.length()-i-1]!=n[i]){
			cout<<"No";return 0;
		}
	}
	cout<<"Yes";
}