#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e6 + 9;
const long long int inf = 1e14;
const long long int MOD = 1e9 + 7;
const long long int mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long int powm(long long int a, long long int b) {
  a = a % mod;
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
string invertible = "AHIMOTUVWXY";
int main() {
  long long int t = 1;
  while (t--) {
    string s;
    cin >> s;
    long long int n = s.size();
    bool po = 1;
    for (int i = 0; i < n; i++) {
      bool inv = 0;
      for (auto j : invertible) {
        inv |= s[i] == j;
      }
      inv &= s[i] == s[(n - i - 1 + n) % n];
      po &= inv;
    }
    if (po) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
}
