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.*;
import java.io.*;
public class Main{
    public static void main(String[] args) {
        Read input = new Read();
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        String str= input.next();
        char []arr=str.toCharArray();
        int count=0;
        for(int i=0;i<arr.length/2;i++){
            if(arr[arr.length-i-1] != arr[i])count++;
            }

        if((count==0 && (arr.length)%2!=0) || count==1)out.println("Yes");
        else out.println("NO");


        out.close();
    }


}

class Read {
    BufferedReader Br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");

    public String next() {
        while (!st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(Br.readLine());
            } catch (IOException ex) {
                ex.printStackTrace();
            }
        }
        return st.nextToken();
    }

    //public int nextInt() {return Integer.parseInt(next());}
    //public long nextLong() {return Long.parseLong(next());}
   /* public int[] ReadArr(int n){
        int []arr=new int[n];
        for(int i=0;i<arr.length ;i++) arr[i]=nextInt();
        return arr;
    }*/
}