Problem:
Score : 100 points

Problem Statement

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:

Reverse the order of the characters in S.

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.

Sample Input 1

pdbq

Sample Output 1

Yes

Sample Input 2

ppqb

Sample Output 2

No

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main {
	public static void main(String[] args){
		Scanner don = new Scanner(System.in);
		String[] an,bn;
		String as;
		an = new String[4];
		bn = new String[4];
		as = don.next();
		for(int i=0;i<4;i++){
			if(String.valueOf(as.charAt(i)).equals("d")){
				an[i]="d";
				bn[i]="b";
			}else if(String.valueOf(as.charAt(i)).equals("b")){
				an[i]="b";
				bn[i]="d";
			}else if(String.valueOf(as.charAt(i)).equals("p")){
				an[i]="p";
				bn[i]="q";
			}else{
				an[i]="q";
				bn[i]="p";
			}
		}
		if(as.equals(bn[3]+bn[2]+bn[1]+bn[0])){
			System.out.println("Yes");
		}else{
			System.out.println("No");
		}
	}
}