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

题解：因为给了字符串是回文字符串，所以只要扫一遍，然后统计不同字符数量就行。

有一个小坑，就是当字符串长度是奇数并且本身就是回文字符串（没有不匹配字符）时，可以通过改变中间字符，达到必须更改一个字符的要求。

代码如下：

//
//  main.cpp
//  A. Mike and palindrome
//
//  Created by 徐智豪 on 2017/4/21.
//  Copyright © 2017年 徐智豪. All rights reserved.
//

#include <iostream>
#include <string>
using namespace std;

int main(int argc, const char * argv[]) {
    string s;
    cin>>s;
    int n=s.size(),count=0;
    for(int i=0;i<n/2;i++)
    {
        if(s[i]!=s[n-i-1])
            count++;
    }
    cout<<((count==1||(count==0&&n%2==1))?"YES":"NO")<<endl;
    return 0;
}