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.*;

public class A {
	public static void main(String[] args) throws Exception {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);

		String str = fs.next();
		int[] freq = new int[26];

		for(int i = 0; i < str.length(); i++) {
			change(str, i);
		}
		
		out.println(yes ?"YES" : "NO");
		
		out.close();
	}
	
	static boolean yes = false;
	
	static void change (String str, int pos) {
		for(int i = 0; i < 26; i++) {
			char n = (char) ((char)i + 'a');
			if(n == str.charAt(pos)) continue;
			String ns = str.substring(0, pos) + n + str.substring(pos+1);
			if(palin(ns)) {
				yes = true;
			}
		}
	}
	
	static boolean palin(String s) {
		return new StringBuilder(s).reverse().toString().equals(s);
	}

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() {
			try {
				br = new BufferedReader(new InputStreamReader(System.in));
				st = new StringTokenizer("");
			} catch (Exception e) {
				e.printStackTrace();
			}
		}

		public String next() {
			if (st.hasMoreTokens()) return st.nextToken();
			try {
				st = new StringTokenizer(br.readLine());
			} catch (Exception e) {
				e.printStackTrace();
			}
			return st.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public String nextLine() {
			String line = "";
			try {
				line = br.readLine();
			} catch (Exception e) {
				e.printStackTrace();
			}
			return line;
		}

		public Integer[] nextIntegerArray(int n) {
			Integer[] a = new Integer[n];
			for (int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}

		public char[] nextCharArray() {
			return nextLine().toCharArray();
		}
	}
}