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: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
char a[1000001],c[1000001];
int main() {
	int b,sum=0,l=0;
	cin>>a;
	b=strlen(a);
	for(int i=0; i<b; i++) {
		c[sum]=a[i];
		if(c[sum]=='b') c[sum]='d';
		else if(c[sum]=='d') c[sum]='b';
		else if(c[sum]=='p') c[sum]='q';
		else if(c[sum]=='q') c[sum]='p';
		sum++;
	}
	for(int i=0; i<b; i++) {
		if(a[i]!=c[i]) {
			cout<<"No"<<endl;
			return 0;
		}
	}
	cout<<"Yes"<<endl;
	return 0;
}