Palindrome Permutation Checker

Given an input string, determine if any permutation of the string can form a palindrome. In other words, check if the characters in the string can be rearranged to read the same forwards and backwards. Ignore spaces and case differences.

Mathematically, a string can form a palindrome if and only if the number of characters with odd frequency is at most one, i.e., $$\text{oddCount} \leq 1.$$

inputFormat

The input consists of a single line containing the string. The string may include spaces and a mix of uppercase and lowercase letters.

outputFormat

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

Tact Coa

True