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<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
int n;
char a[1005],s[10000005];
int main(){
	scanf("%s",s+1);
	n=strlen(s+1);
	a['q']='p';
	a['b']='d';
	a['p']='q';
	a['d']='b';
	for (int i=1;i<=n;i++)
		if (s[i]!=a[s[n-i+1]]){
			printf("No\n");
			return 0;
		}
	printf("Yes\n");
}
