#include <bits/stdc++.h>
using namespace std;
int main() {
  long long ln, n, i;
  string s, ky = "WTYUIOAHXVM";
  map<char, bool> m;
  for (i = 0; i < 11; i++) {
    m[ky[i]] = true;
  }
  cin >> s;
  ln = s.length();
  n = (ln - 1) / 2 + 1;
  for (i = 0; i < n; i++) {
    if (!(m[s[i]] && s[i] == s[ln - i - 1])) {
      i = -1;
      break;
    }
  }
  if (i == -1) {
    printf("NO\n");
  } else {
    printf("YES\n");
  }
}
