Palindrome Rearrangement

Given a string consisting of lowercase alphabetical characters, determine whether it is possible to rearrange its characters to form a palindrome.

A palindrome is a string that reads the same backward as forward. For example, "civic" is a palindrome while "hello" is not. A string can be rearranged into a palindrome if at most one character appears an odd number of times.

Formally, given a string \( s \) of length \( n \), your task is to check if there exists a permutation \( p \) of \( s \) such that \( p = reverse(p) \).

inputFormat

The input is read from standard input (stdin) and consists of a single line containing the string \( s \) that is composed of lowercase letters. The string could be empty.

outputFormat

Print a single line to standard output (stdout) with either True if a palindrome can be formed by rearranging the characters of \( s \), or False otherwise.

civic

True