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;
int pd(char c)
{
	if(c=='b') return 1;
	if(c=='d') return 4;
	if(c=='p') return 2;
	if(c=='q') return 3;
}
int main()
{
	string s;
	cin>>s;
	int flag=0;
	for(int i=0;i<=s.length()-1;i++)
	{
		if(pd(s[i])+pd(s[s.length()-1-i])!=5)
		{
			flag=1;
			break;
		}
		
		
	}
	if(flag==1) cout<<"No";
	else cout<<"Yes";

 return 0;
}
