Taco Palindrome

Given a string ( s ), determine whether it is possible to rearrange its characters into a palindrome by removing at most one letter. A palindrome is a string that reads the same forwards and backwards. Formally, let ( odd ) be the number of characters with odd frequencies in ( s ). The string can be rearranged into a palindrome if and only if ( odd \le 2 ).

inputFormat

Input consists of a single line containing a non-empty string ( s ) composed of lowercase English letters.

outputFormat

Output ( True ) if the string ( s ) can be rearranged into a palindrome by removing at most one character; otherwise, output ( False ).## sample

abcbc

True