#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 55;
int T, n;
char a[22];
int b[22];
int judge() {
  for (int i = 0, j = n - 1; i <= j; i++, j--) {
    if (b[i] != b[j]) return 0;
  }
  return 1;
}
int main() {
  while (scanf("%s", a) == 1) {
    n = strlen(a);
    for (int i = 0; i < n; i++) b[i] = a[i] - 'a';
    int flag = 0;
    for (int i = 0; i < n; i++) {
      for (int j = 1; j < 26; j++) {
        b[i] = (b[i] + j) % 26;
        flag |= judge();
        b[i] = (b[i] - j + 26) % 26;
      }
    }
    printf("%s\n", flag ? "YES" : "NO");
  }
  return 0;
}
