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)
    {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        boolean flag = true;
        for(int i = 0; i <= s.length() / 2; i++){
            char c = s.charAt(i);
            char cc = s.charAt(s.length() - 1 - i);
            switch(c){
                case 'p':
                    if(cc != 'q') flag = false;
                    break;
                case 'q':
                    if(cc != 'p') flag = false;
                    break;
                case 'b':
                    if(cc != 'd') flag = false;
                    break;
                case 'd':
                    if(cc != 'b') flag = false;
                    break;
            }
        }
        String ans = flag? "Yes" : "No";
        System.out.println(ans);
    }
}