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 main()
{char a[100005];int n,i;
scanf("%s",a);
n=strlen(a);
if(n%2==1)
  {cout<<"No"<<endl;
  return 0;
  }
for(i=0;i<n;i++)
  if((a[i]==a[n-i-1])||(a[i]=='q'&&a[n-i-1]=='d')||(a[i]=='q'&&a[n-i-1]=='b')||(a[i]=='p'&&a[n-i-1]=='d')||(a[i]=='p'&&a[n-i-1]=='b'))
    {cout<<"No"<<endl;
    return 0;
	}
cout<<"Yes"<<endl;
return 0;
}