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[100010],a[5]="bpqd";
bool m[128][128];
int main(){
	scanf("%s",s);
	int n=strlen(s);
	if(n%2!=0){
		printf("No\n");
		return 0;
	}
	for(int i=0;i<4;i++)
		m[a[i]][a[3-i]]=true;
	for(int i=0;i<n/2;i++)
		if(!m[s[i]][s[n-i-1]]){
			printf("No\n");
			return 0;
		}
	printf("Yes\n");
	return 0;
}