Problem:
Score : 100 points

Problem Statement

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:

Reverse the order of the characters in S.

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.

Sample Input 1

pdbq

Sample Output 1

Yes

Sample Input 2

ppqb

Sample Output 2

No

Solution in C++ (GCC 5.4.1) (judge verdict: Accepted)

# include <bits/stdc++.h>
using namespace std;

int main() {
	string s1; cin >> s1;
	string s2 = s1;
	reverse(s2.begin(), s2.end());
	for(int i = 0; i < s2.size(); ++i)
		if(s2[i] == 'b') s2[i] = 'd';
		else if(s2[i] == 'd') s2[i] = 'b';
		else if(s2[i] == 'p') s2[i] = 'q';
		else if(s2[i] == 'q') s2[i] = 'p';
	if(s1 == s2) cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}