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>
#define N 100001

char a[N];
char ha[128];

int main()
{	
	int i, l, j;
	
	scanf("%s", a);
	l = strlen(a);
	if(l & 1){
		puts("No");
		return 0;
	}
	ha['p'] = ha['q'] = 1, ha['d'] = ha['b'] = 2;
	
	for(i = 0, j = l - 1; i < j; i++, j--){
		if(ha[a[i]] != ha[a[j]] || a[i] == a[j]){
			puts("No");
			return 0;
		}
	}
	puts("Yes");
		
	return 0;
}