Forming a Palindrome Permutation

Given a string consisting of lowercase English letters, determine whether any permutation of the string can form a palindrome. A palindrome is a string that reads the same backward as forward. Formally, for a given string \( s \), check if it is possible to rearrange its letters such that the resulting string \( t \) satisfies \( t = t^R \), where \( t^R \) is the reverse of \( t \).

Example: For the input \( s = \texttt{'racecar'} \), one permutation 'racecar' is a palindrome, so the answer is True.

You need to implement your solution by reading the input from standard input and printing the result to standard output. The output should be exactly either True or False (case-sensitive).

inputFormat

The input consists of a single line containing a string \( s \) of lowercase English letters. The string may be empty.

For example:

racecar

outputFormat

Output a single line: True if some permutation of \( s \) can form a palindrome, otherwise False.

For example:

True

## sample

racecar

True