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

import static java.lang.System.in;

class Main{
    public static void main(String[] args)throws IOException{
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int n = s.length();
        char[] dic = new char[128];
        dic['b'] = 'd'; dic['d']='b';
        dic['p'] = 'q'; dic['q']='p';
        char[] a = new char[n];
        for(int i=0;i<n;i++) a[i]=s.charAt(n-1-i);
        for(int i=0;i<n;i++) a[i]=dic[a[i]];
        String ans = s.equals(new String(a))?"Yes":"No";
        System.out.println(ans);
    }
}

