Rearrange to Palindrome

Given a string s, determine whether it can be rearranged to form a palindrome. A palindrome is a string that reads the same forward and backward. In other words, after rearranging, the string should satisfy the property:

\( s = s^R \)

where \( s^R \) is the reverse of \( s \). Note that the check is case-insensitive and only alphabetical characters are considered. Non-alphabetical characters should be ignored. A string can be rearranged into a palindrome if at most one of its characters has an odd frequency count.

inputFormat

The input consists of a single line containing the string s.

You should read the input from stdin.

outputFormat

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

The output should be written to stdout.

Tact Coa

True