A. Mike and palindrometime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike 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.InputThe first and single line contains string s (1 ≤ |s| ≤ 15).OutputPrint "YES" (without quotes) if Mike can change exactly one character so that the resulting string is palindrome or "NO" (without quotes) otherwise. ExamplesInputabccaaOutputYESInputabbccaOutputNOInputabcdaOutputYES
Inputabccaa
OutputYES
['brute force', 'constructive algorithms', 'strings', '*1000']