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