Codeforces Round #410 (Div. 2) A. Mike and palindrome

A. Mike and palindrome

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Mike has a string s consisting of only lowercase English letters. He wants to change exactly one character from the string so that the resulting one is a palindrome.

A palindrome is a string that reads the same backward as forward, for example strings "z", "aaa", "aba", "abccba" are palindromes, but strings "codeforces", "reality", "ab" are not.

Input

The first and single line contains string s (1 ≤ |s| ≤ 15).

Output

Print "YES" (without quotes) if Mike can change exactly one character so that the resulting string is palindrome or "NO" (without quotes) otherwise.

Examples

input

abccaa

output

YES

input

abbcca

output

NO

input

abcda

output

YES
晚上要打第一场div2，先拿上一场的热热身，这个题就是改变一个字母使他变为回文串，不能改为相同字母哦，所以要改动字母为0的话只能改变中间的那个

#include <bits/stdc++.h>
using namespace std;
int main(){
int n=0;
string s;
cin>>s;
int l=s.length();
for(int i=0;i<l/2;i++)
if(s[i]!=s[l-1-i])
n++;
if(n==1||n==0&&l%2)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
return 0;
}