Rearrange String to Form a Palindrome

You are given a string s consisting of lowercase letters. Your task is to determine whether the characters in the string can be rearranged to form a palindrome. A string is a palindrome if it reads the same backward as forward.

Hint: 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. In mathematical terms, if we denote the frequency of each character by f_i, the condition is:

[ \sum_{i} (f_i \bmod 2) \leq 1 ]

Read the input from standard input and output the result to standard output.

inputFormat

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

outputFormat

Output True if the given string can be rearranged to form a palindrome; otherwise, output False. (Case sensitive)

civic

True