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 <stdio.h>

int main()
{
	char S[100010];
	scanf ("%s",S);
	int l=0;
	while (S[l]) l++;

	char T[100010];
	for (int i=0;i<l;i++){
		if (S[i] == 'd') T[l-i-1] = 'b';
		if (S[i] == 'b') T[l-i-1] = 'd';
		if (S[i] == 'p') T[l-i-1] = 'q';
		if (S[i] == 'q') T[l-i-1] = 'p';
	}
	for (int i=0;i<l;i++) if (S[i] != T[i]){
		puts("No");
		return 0;
	}
	puts("Yes");
	return 0;
}