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;
int l;
char a[10086000],b[10086000];
int main(void)
{
    cin>>a;
    l=strlen(a);
    l--;
    for(int i=0;a[i]!='\0';i++)
	{
        if(a[i]=='b') b[l]='d';
        if(a[i]=='d') b[l]='b';
        if(a[i]=='p') b[l]='q';
        if(a[i]=='q') b[l]='p';
        l--;
    }
    if(!strcmp(a,b)) printf("Yes\n");
	else printf("No\n");
}