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 len;
string s,s1,s2;
int main() {
	cin>>s;len=s.length();
	for(int i=len-1;i>=0;i--)s1=s1+s[i];
	for(int i=0;i<len;i++){
		if(s1[i]=='b')s2=s2+'d';
		if(s1[i]=='d')s2=s2+'b';
		if(s1[i]=='p')s2=s2+'q';
		if(s1[i]=='q')s2=s2+'p';
	}
	if(s==s2)printf("Yes\n");
	else printf("No\n");
	return 0;
}
