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:

1. Reverse the order of the characters in S.

2. 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`.

Examples

Input

pdbq


Output

Yes


Input

ppqb


Output

No
#include<iostream>
#include<string>
using namespace std;
string s;
char f(char a)
{
  if(a=='b')return 'd';
  if(a=='d')return 'b';
  if(a=='p')return 'q';
  if(a=='q')return 'p';
}
int main()
{
  cin>>s;
  for(int i=0;i<s.size();i++)
    if(s[i]!=f(s[s.size()-i-1])){cout<<"No";return 0;}
  cout<<"Yes";
  return 0;
}
