Anagram Palindrome Check

Given a string of lowercase letters, determine whether its letters can be rearranged to form a palindrome.

A palindrome is a string that reads the same backward and forward. Formally, a string is an anagram of a palindrome if at most one character appears an odd number of times. In mathematical terms, if \(f(c)\) is the frequency of character \(c\) in the string, then the string can be rearranged to form a palindrome if and only if \(\sum_{c}\mathbf{1}_{\{f(c)\ \\text{is odd}\}} \le 1\).

inputFormat

The input consists of a single line containing a string of lowercase letters. The string may be empty.

outputFormat

Output a single line containing either 'True' if the string can be rearranged into a palindrome, or 'False' otherwise.

carrace

True