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 PYTHON3):

Solution:
# cook your dish here
import sys
sys.setrecursionlimit(10**9) 
ll=lambda:map(int,input().split())
t=lambda:int(input())
ss=lambda:input()
lx=lambda x:map(int,input().split(x))
yy=lambda:print("YES")
nn=lambda:print("NO")

#from math import log10 ,log2,ceil,factorial as fac,gcd,inf,sqrt
#from itertools import combinations_with_replacement as cs 
#from functools import reduce
#from bisect import bisect_right as br,bisect_left as bl
#from collections import Counter
#from math import inf


mod=10**9+7

#for _ in range(t()):
def f():
   
    
    s=ss()
    n=len(s)
    fl=0
    for i in range(n//2):
        if s[i]!=s[n-i-1]:
            fl+=1
    if fl==1:
        print("YES")
    elif fl==0:
        if n%2:
            yy()
        else:
            nn()
    else:
        nn()
    
    
            
    
    
                      
f()  
            
    

'''


43
 
'''