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;
bool ismirror(string s)
{
	string ss;
	int len = s.size();
	for(int i = 0;i < len;i++)
	{
		ss += ' ';
	}
	int h = 0;
	for(int i = len-1;i >= 0;i--)
	{
		ss[h++] = s[i];
	}
	for(int i = 0;i < len;i++)
	{
		if(ss[i] == 'b')
		{
			ss[i] = 'd';
			continue;
		}else if(ss[i] == 'd')
		{
			ss[i] = 'b';
			continue;
		}else if(ss[i] == 'p')
		{
			ss[i] ='q';
			continue;
		}else if(ss[i] == 'q')
		{
			ss[i] = 'p';
			continue;
		}
	}
	if(ss == s)
	{
		return true;
	}else
	{
		return false;
	}
}
int main()
{
	string s;
	cin>>s;
	if(ismirror(s))
	{
		cout<<"Yes";
	}else cout<<"No";
	return 0;
	
}