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.*;
import java.lang.*;

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		StringBuilder t = new StringBuilder(s);
		t.reverse();
		boolean no = false;
		for (int i = 0; i < s.length(); i++) {
			if (s.charAt(i) == 'b') {
				if (t.charAt(i) != 'd') {
					no = true;
					break;
				}
			} else if (s.charAt(i) == 'd') {
				if (t.charAt(i) != 'b') {
					no = true;
					break;
				}
			} else if (s.charAt(i) == 'p') {
				if (t.charAt(i) != 'q') {
					no = true;
					break;
				}
			} else if (s.charAt(i) == 'q') {
				if (t.charAt(i) != 'p') {
					no = true;
					break;
				}
			}
		}
		if (no) {
			System.out.println("No");
		} else {
			System.out.println("Yes");
		}
	}
}