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.io.*;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class Task798A {

    public static void main(String... args) throws NumberFormatException,
            IOException {
        Solution.main(System.in, System.out);
    }

    static class Strings {
        static boolean isPalindrome(String inp) {
            for (int i = 0; i < inp.length(); i++) {
                if (inp.charAt(i) != inp.charAt(inp.length() - 1 - i)) {
                    return false;
                }
            }
            return true;
        }
    }

    static class Scanner implements AutoCloseable {

        private final BufferedReader br;
        private String[] cache;
        private int cacheIndex;

        Scanner(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
            cache = new String[0];
            cacheIndex = 0;
        }

        int nextInt() throws IOException {
            if (cacheIndex >= cache.length) {
                cache = br.readLine().split(" ");
                cacheIndex = 0;
            }
            return Integer.parseInt(cache[cacheIndex++]);
        }

        long nextLong() throws IOException {
            if (cacheIndex >= cache.length) {
                cache = br.readLine().split(" ");
                cacheIndex = 0;
            }
            return Long.parseLong(cache[cacheIndex++]);
        }

        String next() throws IOException {
            if (cacheIndex >= cache.length) {
                cache = br.readLine().split(" ");
                cacheIndex = 0;
            }
            return cache[cacheIndex++];
        }

        public void close() throws IOException {
            br.close();
        }

    }

    static class Solution {


        public static void main(InputStream is, OutputStream os)
                throws NumberFormatException, IOException {

            try (PrintWriter pw = new PrintWriter(os)) {
                try (Scanner sc = new Scanner(is)) {

                    String s = sc.next();
                    String proof;
                    boolean retVal = false;

                    for (int i = 0; i < s.length(); i++) {
                        for (char replacement = 'a'; replacement <= 'z'; replacement++) {
                            if (replacement != s.charAt(i)) {
                                proof = s.substring(0, i) + replacement + s.substring(i + 1, s.length());
                                if (Strings.isPalindrome(proof)) {
                                    retVal = true;
                                    break;
                                }
                            }
                        }
                        if (retVal) {
                            break;
                        }
                    }

                    pw.println(retVal ? "YES" : "NO");

                }

            }

        }
    }

}