#include <bits/stdc++.h>
using namespace std;
char s;
int a[1010];
string ss;
bool f;
int main() {
  cin >> ss;
  int lm = ss.size(), n;
  if (lm % 2 == 0)
    n = lm / 2;
  else
    n = lm / 2, ++n;
  for (int i = 0; i < n; i++) {
    if ((ss[i] == 'p') && (ss[n - i + 1] == 'q'))
      continue;
    else if ((ss[i] == 'd') && (ss[n - i + 1] == 'b'))
      continue;
    else if ((ss[i] == 'b') && (ss[n - i + 1] == 'd'))
      continue;
    else if ((ss[i] == 'q') && (ss[n - i + 1] == 'p'))
      continue;
    else {
      puts("NO");
      return 0;
    }
  }
  puts("Yes");
  return 0;
}
