Almost Palindromic String

Given a string consisting of lowercase English letters, determine whether it is almost palindromic. A string is almost palindromic if it is either already a palindrome, or it can become a palindrome by removing at most one character.

A palindrome is a string that reads the same backward as forward. For example, the string radar is a palindrome, while radcar is not a palindrome but is almost palindromic because removing the character c results in radar.

inputFormat

Input is provided via standard input (stdin) as a single line containing the string s. The string s consists only of lowercase English letters and has a length in the range (0 \leq |s| \leq 10^5).

outputFormat

Output a single line to standard output (stdout) which is either "True" or "False" (without quotes), indicating whether the given string is almost palindromic.## sample

radcar

True