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