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<algorithm>
#include<iostream>
#include<string>
#include<map>
using namespace std;

string s, s_;
map<char, char> to;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> s;
	s_ = s;
	reverse(s.begin(), s.end());
	to['b'] = 'd', to['d'] = 'b', to['p'] = 'q', to['q'] = 'p';
	for(auto &c : s) c = to[c];
	cout << (s == s_? "Yes": "No") << '\n';
	return 0;
}
