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<cstdio>
#include<string>
using namespace std;
int main()
{
	string s,t;
	int i,x;
	cin >> s;
	t = s;
	x = s.size();
	for (i = 0; i < x; i++) {
		if (s[i] == 'b') t[x - i - 1] = 'd';
		else if (s[i] == 'd') t[x - i - 1] = 'b';
		else if (s[i] == 'p') t[x - i - 1] = 'q';
		else if (s[i] == 'q') t[x - i - 1] = 'p';
	}
	printf((s == t) ? "Yes\n" : "No\n");
	return 0;
}