#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
  if (!b) return a;
  return gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return a * b / gcd(a, b);
}
bool solve(string s) {
  int flag = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] != s[s.size() - i - 1]) {
      flag = 1;
      break;
    }
  }
  if (flag)
    return false;
  else
    return true;
}
int arr[1000];
int main() {
  string s;
  cin >> s;
  int flag = 0;
  for (int i = 0; i < s.size(); i += 1) {
    if (s[i] == 'A' || s[i] == 'H' || s[i] == 'I' || s[i] == 'M' ||
        s[i] == 'O' || s[i] == 'T' || s[i] == 'U' || s[i] == 'V' ||
        s[i] == 'W' || s[i] == 'X' || s[i] == 'Y') {
      continue;
    } else {
      flag = 1;
      break;
    }
  }
  if (flag) {
    cout << "NO";
    return 0;
  } else {
    if (solve(s)) {
      cout << "YES" << '\n';
    } else {
      cout << "NO" << '\n';
    }
  }
  return 0;
}
