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
//zdj
#include<cstdio>
#include<cstring>
char s[100010],c[120];
signed main()
{
	scanf("%s",s),c[98]=0,c[100]=2,c[112]=1,c[113]=3;int l(strlen(s)),ll(l>>1);
	for(register int i(0);i<=ll;i++)
		if(c[s[i]]^((c[s[l-i-1]]+2)%4))
			return puts("No"),0;
	return puts("Yes"),0;
}