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
import java.util.Scanner;
public class Main{
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		String s=scanner.next();
		StringBuilder sb=new StringBuilder(s);
		String sf=sb.reverse().toString();
		char[] ch=sf.toCharArray();
		String s2=String.valueOf(ch);
	
		for (int i=0;i<ch.length;i++) {
			if (ch[i]=='b') {
				ch[i]='d';
				continue;
			}
			if (ch[i]=='d') {
				ch[i]='b';
				continue;
			}
			if (ch[i]=='p') {
				ch[i]='q';
				continue;
			}
			if (ch[i]=='q') {
				ch[i]='p';
				continue;
			}
		}
		String s1=String.valueOf(ch);
		
		if (s1.equals(s)) {
			System.out.print("Yes");
		}else {
			System.out.print("No");
		}
	}
}