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 <stdio.h>
#include <string.h>
int main(void){
    char s[100000],m[100000];
    int i;
    
    gets(s);
    
    for(i=0;i<strlen(s);i++){
        if(s[strlen(s)-i-1]==98){
            m[i]=100;
        }else if(s[strlen(s)-i-1]==100){
            m[i]=98;
        }else if(s[strlen(s)-i-1]==112){
            m[i]=113;
        }else if(s[strlen(s)-i-1]==113){
            m[i]=112;
        }
    }
    if(strcmp(s,m)==0){
        printf("Yes\n");
    }else{
        printf("No\n");
    }
    return 0;
}