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.math.*;
import java.io.*;
import java.util.*;
public class SarthakCode 
{
	static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
	static PrintWriter pw= new PrintWriter(System.out);
	
	public static void main(String args[])throws Exception
	{
		int c=0;
		String s=br.readLine();
		for(int i=0;i<s.length()/2;i++)
		{
			if(s.charAt(i)!=s.charAt(s.length()-1-i))
				c++;
		}
		if(c==1 || (c==0 && s.length()%2!=0))
			pw.println("YES");
		else
			pw.println("NO");
		pw.close();
	}
}
	
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;
 
    public FastScanner(BufferedReader in)
    {
        this.in = in;
    }
    public String nextToken() throws Exception
    {
        while (st == null || !st.hasMoreTokens())
        {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
   	public String next() throws Exception
	{
		return nextToken().toString();
	}
    public int nextInt() throws Exception
    {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws Exception 
    {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws Exception 
    {
        return Double.parseDouble(nextToken());
    }
}