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