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>
char c[125],s[100001],t[100001];
int main(){
	c['b']='d',c['d']='b',c['p']='q',c['q']='p';
	scanf("%s",s);
	int l=strlen(s);
	for(int i=0;i<l;++i)t[l-i]=c[s[i]];
	for(int i=0;i<l;++i)
		if(s[i]!=t[i+1])
			return puts("No"),0;
	puts("Yes");
}