One Change Palindrome

Given a string s, determine if it is possible to convert it into a palindrome by changing at most one character. A palindrome is a string that reads the same forwards and backwards.

You are allowed to replace at most one character in the string with any other character. If the string can become a palindrome with at most one such change, output YES, otherwise output NO.

Note: A string that is already a palindrome is considered valid.

inputFormat

The input consists of a single line containing the string s, which consists only of lowercase English letters.

outputFormat

Output a single line with either YES or NO indicating whether it is possible to convert the string into a palindrome by changing at most one character.

## sample

abca

YES

</p>