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<stdio.h>
#include<cstring>
char s[100005];
char f['z'];
int len;
int main(){
	f['b']='d';
	f['d']='b';
	f['p']='q';
	f['q']='p';
	scanf("%s",s+1);
	len=strlen(s+1);
	if (len&1){
		puts("No");
		return 0;
	}
	int p=len>>1;
	for (int i=1;i<=p;i++){
		if (f[s[i]]!=s[len-i+1]){
			puts("No");
			return 0;
		}
	}
	puts("Yes");
	return 0;
}