Can Form Palindrome

Given a string s, determine if any permutation of s can form a palindrome. A string can be rearranged into a palindrome if at most one character appears an odd number of times. Mathematically, if the number of characters with odd frequency satisfies $$\text{odd_count} \le 1$$, then the string can form a palindrome.

For example, consider the string "civic" which is already a palindrome, and "ivicc" which can be rearranged as "civic". On the other hand, the string "hello" cannot form any palindrome permutation.

inputFormat

The input is provided via stdin as a single line containing the string s.

Note: The string may consist of any characters. An empty string is considered a palindrome.

outputFormat

The output should be printed to stdout. Output True if some permutation of the given string can form a palindrome; otherwise, output False.

civic

True