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(){
	char a[100005];cin>>a;
	int s=strlen(a);int sum=0;
	if(s%2!=0){
		cout<<"No";return 0;
	}
	for(int i=0;i<s;i++){
		if(a[i]=='p'&&a[s-i-1]=='q')sum++;
		if(a[i]=='q'&&a[s-i-1]=='p')sum++;
		if(a[i]=='d'&&a[s-i-1]=='b')sum++;
		if(a[i]=='b'&&a[s-i-1]=='d')sum++;
	}
	if(sum==s)cout<<"Yes";
	else cout<<"No";
	return 0;
} 