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.*;

class Main {
        public static void main(String args[]) {
                try (Scanner sc = new Scanner(System.in)) {
                        String S = sc.next();
                        boolean f = true;
                        for (int i = 0; i <= (S.length()-1) / 2; i++) {
                                switch (S.charAt(i)) {
                                        case 'b':{
                                                if (S.charAt(S.length() - i - 1) != 'd') {
                                                        f = false;
                                                }
                                                break;
                                        }
                                        case 'd':{
                                                if (S.charAt(S.length() - i - 1) != 'b') {
                                                        f = false;
                                                }
                                                break;
                                        }
                                        case 'q':{
                                                if (S.charAt(S.length() - i - 1) != 'p') {
                                                        f = false;
                                                }
                                                break;
                                        }
                                        case 'p':{
                                                if (S.charAt(S.length() - i - 1) != 'q') {
                                                        f = false;
                                                }
                                                break;
                                        }
                                }
                        }
                        if (f) {
                                System.out.println("Yes");
                        } else {
                                System.out.println("No");
                        }
                }
        }
}