Permutable Palindrome

Given a string \( s \), determine if any permutation of \( s \) can form a palindrome. A palindrome is a string that reads the same forwards and backwards. In other words, check whether the characters of the string can be rearranged such that they form a palindrome.

For example, the string "carrace" can be rearranged to "racecar" which is a palindrome, while "hello" cannot be rearranged into any palindrome.

inputFormat

The input consists of a single line containing a non-empty string \( s \) composed of printable characters. The string may include letters, digits, and special characters.

outputFormat

Output a single boolean value: True if any permutation of the string can form a palindrome, and False otherwise.

carrace

True