Problem: 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

Solution (in JAVA):

Solution:
import java.util.Scanner;

/**
 * Created by y.omelchuk on 4/27/2017.
 */
public class test {
//    public static String data = "abccaa";
//    public static String data = "abcda";
    static boolean  state = false;
    public static int N;
    public static  void main(String args[]){
        Scanner sc  = new Scanner(System.in);
        String data = sc.next();
        N = data.toCharArray().length;
       boolean check =  checkToPalindrome(data.toCharArray());
//        for (int i=0;i<N;i++){
//                if(checkIsPalindrome(changedata(i,check[0],data.toCharArray()))){
//                    state = true;
//                }
//            if(checkIsPalindrome(changedata(i,check[1],data.toCharArray()))){
//                state = true;
//            }
//
//        }
        if(check){
            System.out.println("YES");
        }else{
            System.out.println("NO");
        }
    }

//    public static char[] changedata(int index , char data, char[] source){
//        char temp;
//        char[] innerchar = source;
//        innerchar[index] = data;
//        return innerchar;
//    }
//
//    public static boolean checkIsPalindrome(char[] source){
//        char[] innerdata = source;
//        int count = 0;
//        for(int j = 0;j<innerdata.length;j++){
//            if(innerdata[j]==innerdata[innerdata.length-1-j]){
//                count++;
//            }
//            if(count==innerdata.length-1){
//                return true;
//            }
//        }
//        return false;
//    }

    public static boolean checkToPalindrome(char[] source) {
        char[] innerdata = source;
        int count = 0;
        for (int j = 0; j < innerdata.length/2; j++) {
            if (innerdata[j] != innerdata[innerdata.length - 1 - j]) {
                count++;
            }
        }
        if (count == 1 || ( count==0&&innerdata.length%2!=0) ) {
            return true;
        }
        return false;
    }
}