One-Removal Palindrome

Given a string s, determine whether it is possible to delete exactly one character from s such that the resulting string is a palindrome.

A palindrome is a string that reads the same forwards and backwards. Formally, for a string \( s \) of length \( n \), it is a palindrome if \( s_i = s_{n-i+1} \) for every \( 1 \leq i \leq n \). You are allowed to delete exactly one character and check if the remaining string becomes a palindrome. If so, output True; otherwise, output False.

Note: When the string is already a palindrome, you should return False since deletion is not needed.

inputFormat

The input consists of a single line containing the string \( s \). The string may include letters and has a length of at least 1.

outputFormat

Output a single line: True if it is possible to delete exactly one character from the input string to form a palindrome, and False otherwise.

abca

True