Permutation of Palindrome

Given a string (s), determine whether any permutation of (s) can form a palindrome. A string is a permutation of a palindrome if, after removing all whitespace and converting all letters to lowercase, the frequency of each character allows the formation of a palindrome. In a palindrome, at most one character can appear an odd number of times (this character would be in the center for odd-length palindromes), while the others must appear an even number of times. The task is to check if the given string satisfies this condition.

inputFormat

The input is given via standard input (stdin) as a single line containing the string (s). The string may include spaces and mixed-case letters.

outputFormat

Output to standard output (stdout) a single line: output (True) if the input string is a permutation of a palindrome, otherwise output (False).## sample

racecar

True