Palindrome Permutation Check

Given a string, determine whether any permutation of the string can form a palindrome. A palindrome is a sequence that reads the same backward as forward. In other words, a string can be rearranged into a palindrome if at most one character appears an odd number of times.

For example, the string "aabb" can form the palindrome "abba" or "baab", whereas the string "hello" cannot be rearranged into a palindrome.

inputFormat

The input consists of a single line containing the string to be checked.

outputFormat

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

racecar

True