#include <bits/stdc++.h>
using namespace std;
int a[10005], b[10005], n;
int f(char x) {
  if (x == 'b') return 1;
  if (x == 'd') return 2;
  if (x == 'p') return 3;
  if (x == 'q') return 4;
}
int main() {
  string s;
  cin >> s;
  n = s.length();
  for (int i = 1; i <= n; i++) a[i] = f(s[i - 1]), b[i] = a[i];
  for (int i = 1; i <= n / 2; i++) swap(a[i], a[n + 1 - i]);
  for (int i = 1; i <= n; i++) {
    if (a[i] == 1)
      a[i] = 2;
    else if (a[i] == 2)
      a[i] = 1;
    else if (a[i] == 3)
      a[i] = 4;
    else
      a[i] = 3;
  }
  for (int i = 1; i <= n; i++)
    if (a[i] != b[i]) {
      puts("No");
      return 0;
    }
  puts("Yes");
  return 0;
}
