Time limit: 1.0s
Memory limit: 64M
You are given a string ~A~. You want to remove the most number of characters to make the string a palindrome.
A palindrome is defined as a string of length greater than or equal to ~1~ that is the same forwards as it is backwards.
The first line will contain the string ~A~ ~(1 \le |A| \le 10^5)~. ~A~ is guaranteed to only contain lowercase alphabetical characters.
Print the maximum number of characters that can be removed to make the string a palindrome.