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)

//666yuchen
#include<bits/stdc++.h>
using namespace std;
string st;
char b[500];
int main()
{
  cin>>st;
  b['b']='d';b['d']='b';b['p']='q';b['q']='b';
  for(int i=0;i<st.size();i++)if(b[i]!=st[st.size()-1-i]){cout<<"No"<<endl;return 0;}
  cout<<"Yes"<<endl;
  return 0;
}