#410_A.cpp

gistfile1.txt

#include <iostream>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>

#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)>(b)?(b):(a)
#define ll long long int
#define ull unsigned long long int

char s[20];
int l;

bool isPalindrome(int a)
{
	if (s[a] == s[l - a - 1] && (a != l - a - 1)) return false;

	for (int i = 0; i < l; i++)
	{
		if (s[i] != s[l - i - 1] && (a != i) && (a != l - i - 1))
		{
			return false;
		}
	}
	return true;
}

void process() {

	for (int i = 0; i < l; i++)
	{
		if (isPalindrome(i))
		{
			printf("YES\n");
			return;
		}
	}

	printf("NO\n");
	return;
}

int main() {
	scanf("%s", s);
	l = strlen(s);

	process();

	return 0;
}