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

Solution:
# helper methods for input
def ri():
    return raw_input()


def ii(type):
    x = ri()
    if type == 'i':
        return int(x)
    if type == 'l':
        return long(x)
    if type == 'f':
        return float(x)
    if type == 's':
        return str(x)
    return


def i2(type):
    x = ri().split()
    if type == 'i':
        return int(x[0]), int(x[1])
    if type == 'l':
        return long(x[0]), long(x[1])
    if type == 'f':
        return float(x[0]), float(x[1])
    if type == 's':
        return str(x[0]), str(x[1])
    return


def ni(type):
    array = ri().split()
    def doforall(x):
        if type == 'i':
            return int(x)
        if type == 'l':
            return long(x)
        if type == 'f':
            return float(x)
        if type == 's':
            return str(x)
        return
    array = map(doforall, array)
    return array


def pr(array):
    def tostring(el):
        return str(el)
    print ' '.join(map(tostring, array))


def fndec(x):
    return '{0:.6f}'.format(x)


# main
def f(s, i, n):
    c = 0 if s[i] == s[n-i-1] else 1;
    if i+1 >= n/2:
        return c
    return c + f(s, i+1, n)

inp = ri()
if f(inp, 0, len(inp)) == 1 or (f(inp, 0, len(inp)) == 0 and len(inp)%2 == 1):
    print 'YES'
else:
    print 'NO'