Palindromic Permutations

Given a string ( s ), determine whether its characters can be rearranged to form a palindrome. A palindrome is a string that reads the same backward as forward. According to the property of palindromes, a string can form a palindrome if and only if the number of characters that appear an odd number of times is at most one, i.e., ( \text{odd_count} \leq 1 ). Read the input from standard input and print the result to standard output.

inputFormat

The input consists of a single line containing the string ( s ). The string can include any characters without spaces.

outputFormat

Output a single line: print 'True' if the characters of the string can be rearranged to form a palindrome; otherwise, print 'False'.## sample

civic

True