Rearrange String to Form a Palindrome

Given a string s, determine whether its characters can be rearranged to form a palindrome. A palindrome is a string that reads the same forwards and backwards. To achieve this, at most one character is allowed to appear an odd number of times.

In mathematical terms, let \( O \) be the number of characters with odd frequency counts. Then the condition is given by: $$O \leq 1$$

The string should be preprocessed by removing all non-alphanumeric characters and converting all letters to lowercase before the above condition is checked.

inputFormat

The input consists of a single line containing a string s. The string may include spaces, punctuation, and mixed cases.

outputFormat

Output a single line: True if the string can be rearranged to form a palindrome, or False otherwise.

racecar

True