Anagram Palindrome

Given a string ( s ) consisting of lowercase letters, determine if any permutation of ( s ) can form a palindrome. A palindrome is a string that reads the same forwards and backwards. A necessary and sufficient condition for a string to be rearranged into a palindrome is that at most one character has an odd frequency, i.e. ( \text{odd_counts} \le 1 ).

Input is provided through the standard input and output should be written to the standard output.

inputFormat

The input consists of a single line containing the string ( s ) (only lowercase letters).

outputFormat

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

civic

True