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<stdio.h>
#include<string.h>
char a[100000010];
int main(){
    scanf("%s",a);
    int t=1;
    for(int i=0;i<=(strlen(a)-1)/2;i++){
        if((a[i]=='d'&&a[strlen(a)-i-1]=='b')||(a[i]=='b'&&a[strlen(a)-i-1]=='d')||(a[i]=='q'&&a[strlen(a)-i-1]=='p')||(a[i]=='p'&&a[strlen(a)-i-1]=='q'));
        else t=0;
    }
    if(t)printf("Yes");
    else printf("No");
}