Palindrome Permutation

Given a string (s), determine if it is a permutation of a palindrome. A permutation of a palindrome means that the characters of (s) can be rearranged to form a palindrome. For a palindrome, if its length is even, every character must appear an even number of times; if odd, then exactly one character can appear an odd number of times. In other words, letting (\text{odd_count}) be the number of characters with an odd frequency, the condition is (\text{odd_count} \le 1). Note that the string may include uppercase, lowercase letters, spaces, and punctuation. Non-alphabetic characters should be ignored and character comparison should be case-insensitive.

inputFormat

A single line string (s). The string may include spaces, punctuation, and mixed case letters.

outputFormat

Output either 'True' or 'False' (without quotes) indicating whether the input string is a permutation of a palindrome.## sample

Tact Coa

True