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;
char s[1000000],s1[1000000];
map<char,char>mp;
int main(){
	gets(s+1);
	mp['b']='d';mp['d']='b';mp['p']='q';mp['q']='p';
	int l=strlen(s+1);
	for(int i=1;i<=l;i++)
	s1[l-i+1]=mp[s[i]];
	if(strcmp(s+1,s1+1)==0)puts("Yes");
	else puts("No");
	return 0;
}