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;

char buf[114514];
string s1;
string s2;

int main() {
  scanf("%s", buf);
  s1 = buf;

  map<char, char> rev;
  rev['b'] = 'd';
  rev['d'] = 'b';
  rev['p'] = 'q';
  rev['q'] = 'p';
  for (int i=s1.size()-1; i>=0; i--) {
    s2 += rev[s1[i]];
  }

  if (s1 == s2) puts("Yes");
  else puts("No");
}
