Can Form Palindrome?

This problem requires you to determine whether the characters of a given string can be rearranged to form a palindrome. A palindrome is a string that reads the same forwards and backwards. The solution should consider the string case-insensitively and ignore all non-alphabetic characters.

For a string to be rearranged into a palindrome, it must satisfy the condition \(\text{odd\_count} \leq 1\), meaning that at most one character may appear an odd number of times. The expected time complexity is \(O(n)\), where \(n\) is the length of the input string.

inputFormat

A single line containing the input string. The input is provided via standard input (stdin).

outputFormat

Print 'True' (without quotes) if the characters can be rearranged to form a palindrome; otherwise, print 'False'. The result should be printed to standard output (stdout).## sample

A man, a plan, a canal, Panama

True