Palindrome Permutation

Given a string s consisting of lowercase English letters, determine whether any permutation of the string can form a palindrome.

A string is said to be a palindrome if it reads the same forward and backward. Mathematically, for a string of length n, a necessary and sufficient condition for a permutation of the string to form a palindrome is that at most one character appears an odd number of times. In other words, if we denote by $$ odd = \#\{ c : count(c) \text{ is odd} \} $$ then a palindrome permutation exists if and only if $$ odd \leq 1 $$.

Your task is to write a program that reads an input string and outputs True if some permutation can form a palindrome, and False otherwise.

inputFormat

The input consists of a single line containing the string s (1 ≤ length of s ≤ 10⁵), composed solely of lowercase English letters.

outputFormat

Output a single line with either True or False. Output True if some permutation of the input string can form a palindrome; otherwise, output False.

aabb

True