Palindrome Permutation Checker

Given a string, determine if any permutation of it can form a palindrome. A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward. This problem disregards spaces and is case insensitive.

More formally, a string is a permutation of a palindrome if the frequency of each character (ignoring spaces and case) is even, except for at most one character which can appear an odd number of times. In mathematical terms, let \( f(c) \) be the frequency of character \( c \) in the transformed string. The string can be rearranged to form a palindrome if and only if \[ \sum_{c} \left[ f(c) \mod 2 \neq 0 \right] \leq 1, \] where \( [P] \) denotes the Iverson bracket that is 1 if property \(P\) holds and 0 otherwise.

Your task is to write a program that reads a string from standard input and prints "True" if a palindromic permutation exists, or "False" otherwise.

inputFormat

The input consists of a single line containing a string \( s \). This string may include spaces and can be in mixed case.

outputFormat

Output a single line with either "True" if the input string's characters can be rearranged to form a palindrome or "False" otherwise.

racecar

True