Palindrome Permutation

This problem asks you to determine whether any permutation of the given string can form a palindrome. A string can be rearranged to form a palindrome if and only if the number of characters with odd frequency is at most one. In mathematical terms, for a string S, a palindrome permutation exists if $$\#\{c \in S : count(c) \% 2 \neq 0\} \leq 1$$.

You are given a string S and you are required to output "True" if any permutation of S can form a palindrome, and "False" otherwise. The check should be case-insensitive and includes all characters.

inputFormat

The input consists of a single line containing the string S. The string may contain letters (in any case), numbers, or special characters.

outputFormat

Output a single line: "True" if any permutation of the input string can form a palindrome, and "False" otherwise.

civic

True