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<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
	string a;
	cin>>a;
	string b;
	b=a;
	reverse(b.begin(),b.end());
	int n=b.size();
	for(int i=0;i<n;i++){
		if(b[i]=='b')b[i]='d';
		else if(b[i]=='p')b[i]='q';
		else if(b[i]=='d')b[i]='b';
		else if(b[i]=='q')b[i]='p';
	}
	if(a==b)cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
}