Permutation Palindrome Checker

Given a string ( S ), determine whether any permutation of ( S ) can form a palindrome. A palindrome is a string that reads the same backward as forward. The test is case-insensitive and only considers the letters a–z; all other characters are ignored. For example, the string "Tact Coa" can be rearranged to form "taco cat", which is a palindrome.

Input Format: A single line containing the string ( S ).

Output Format: Output True if any permutation of the string can form a palindrome, otherwise output False.

inputFormat

The input consists of a single line containing the string ( S ) which may include spaces, punctuation, and mixed cases. Only alphabetic characters (a–z, A–Z) are considered for palindrome formation.

outputFormat

Print a single line: True if any permutation of ( S ) can form a palindrome, or False otherwise.## sample

Tact Coa

True