Palindrome Permutation Check

Given a string s, determine whether any permutation of s can form a palindrome. A string is a permutation of a palindrome if and only if at most one character has an odd number of occurrences. Formally, let \( f(x) \) be the frequency of character \( x \) in s; then a permutation of s is a palindrome if and only if \( \sum_{x} [f(x) \bmod 2 \neq 0] \leq 1 \).

The input is given through standard input and the output should be printed to standard output as "True" if the string can be permuted into a palindrome, and "False" otherwise.

inputFormat

The input consists of a single line containing the string s. The string may consist of lowercase and/or uppercase letters. There are no additional inputs.

outputFormat

Print a single line containing either "True" if any permutation of the string forms a palindrome, or "False" otherwise.

tacocat

True