Palindrome Rearrangement

This problem requires you to determine whether a given string s consisting of lowercase English letters can be rearranged to form a palindrome.

A string is a palindrome if it reads the same backward as forward. A well-known necessary and sufficient condition is that at most one character appears an odd number of times. In mathematical terms, if we denote the frequency of each character as \( f(c) \), the string can be rearranged into a palindrome if:

[ \sum_{c\in\text{alphabet}} [f(c) \mod 2 \neq 0] \leq 1 ]

Your task is to implement a solution that reads the input string from the standard input and outputs either "True" if it is possible to form a palindrome by rearrangement, or "False" otherwise.

inputFormat

The input consists of a single line containing a non-empty string s composed of only lowercase English letters. The string may also be empty.

outputFormat

Output a single line containing either "True" or "False" (without quotes). "True" if the characters of s can be rearranged to form a palindrome, otherwise "False".

civic

True