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 <bits/stdc++.h>
using namespace std;

template<typename T>
void fin(T a){
  cout<<a<<endl;
  exit(0);
}

signed main(){
  string s;cin>>s;
  int n=s.size();
  for(int i=0;i<=n/2;i++){
    if(s[i]=='b'&&s[n-1-i]!='d')fin("No");
    if(s[i]=='d'&&s[n-1-i]!='b')fin("No");
    if(s[i]=='p'&&s[n-1-i]!='q')fin("No");
    if(s[i]=='q'&&s[n-1-i]!='p')fin("No");
  }
  fin("Yes");
}
