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<stdlib.h>
#include<string.h>
#define STR_LEN 100000
void judge(char *);
void judge(char *s)
{
    int i,j,flag=1;
    int n=strlen(s);
    for(i=0,j=n-1;i<j;i++,j--)
    {
        if((s[i]=='p'&&s[j]=='q')||(s[i]=='q'&&s[j]=='p')||(s[i]=='b'&&s[j]=='d')||(s[i]=='d'&&s[j]=='b'))
        {
            continue;
        }
        else
        {
            flag=0;
            break;
        }
    }
    printf((flag==1)?"Yes\n":"No\n");
}
int main()
{
    char a[STR_LEN+1]={0};
    scanf("%s",a);
    judge(a);
    return 0;
}