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>
#include<map>
using namespace std;

int main(){
  string s;
  int n;
  cin>>s;
  n=s.length();
  map<char,int> m;
  m.insert({'p',0});
  m.insert({'q',1});
  m.insert({'b',2});
  m.insert({'d',3});
  for(int i=0;i<n;i++){
    if((m[s[i]]^m[s[n-1-i]])!=1){
      cout<<"No"<<endl;
      return 0;
    }
  }
  cout<<"Yes"<<endl;
}
