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<string.h>
#include<math.h>
int main()
{
	char s[100001];
	
	scanf("%s",s);
	
	if(strlen(s)%2==1)
	{
		printf("No");
		return 0;
	}
	for(int i=0,j=strlen(s)-1;i<j;i++,j--)
	if(abs(s[i]-s[j])>2||s[i]==s[j]) 
	{
		printf("No");
		return 0;
	}
	printf("Yes"); 
	
	return 0;
}