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>
#include<cstring>
using namespace std;

char ss[100010];
int len;

char mir(int x){
	if(ss[x]=='b') return 'd';
	if(ss[x]=='d') return 'b';
	if(ss[x]=='p') return 'q';
	if(ss[x]=='q') return 'p';
} 

int main(){
	cin>>ss; len=strlen(ss);
	for(int i=0;i<len;i++)
		if(mir(len-i-1)!=ss[i]){
			cout<<"No"<<endl;
			return 0;
		}
	cout<<"Yes"<<endl;
	return 0;
}