#include <bits/stdc++.h>
using namespace std;
map<char, int> h;
int main() {
  string s;
  int a[10005], b[10005];
  cin >> s;
  h.insert(make_pair('b', 1));
  h.insert(make_pair('d', 2));
  h.insert(make_pair('p', 3));
  h.insert(make_pair('q', 4));
  int n = s.length();
  for (int i = 1; i <= n; i++) a[i] = h[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;
}
