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 <stdio.h>
#include <stdlib.h>

int main(){
	int N, i;
	char *S = (char *)malloc(sizeof(char) * 100001);
	scanf("%s", S);
	for(N = 0; S[N] != '\0'; N++){}
	for(i = 0; i < N; i++){
		if(S[i] == 'b'){
			if(S[N - 1 - i] != 'd'){
				printf("No\n");
				return 0;
			}
		}
		else if(S[i] == 'd'){
			if(S[N - 1 - i] != 'b'){
				printf("No\n");
				return 0;
			}
		}
		else if(S[i] == 'p'){
			if(S[N - 1 - i] != 'q'){
				printf("No\n");
				return 0;
			}
		}
		else{
			if(S[N - 1 - i] != 'p'){
				printf("No\n");
				return 0;
			}
		}
	}
	printf("Yes\n");
	return 0;
}