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[100009],st[100009],ss[100009];
int len;
int main()
{
	gets(s);
	len=strlen(s);
	for(int i=0;i<strlen(s);++i)
		st[len-i-1]=s[i];
	for(int i=0;i<strlen(st);++i)
	{
		if(st[i]=='b') ss[i]='d';
		if(st[i]=='d') ss[i]='b';
		if(st[i]=='p') ss[i]='q';
		if(st[i]=='q') ss[i]='p';
	}
	if(strcmp(s,ss)==0) cout<<"Yes";
	else cout<<"No";
	return 0;
}
