Mike and palindrome

Time Limit: 2 seconds

Memory Limit: 256 megabytes

Description

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.

Sample Input

Input
abccaa
Output
YES
Input
abbcca
Output
NO
Input
abcda
Output
YES

Sample Output

None

Hint

None

Source

None

提交代码