#K79172. Taco Palindrome Challenge

    ID: 35250 Type: Default 1000ms 256MiB

Taco Palindrome Challenge

Taco Palindrome Challenge

Given a string s that consists of only lowercase English letters, determine whether it is possible to rearrange the characters of s to form a palindrome.

A palindrome is a string that reads the same forwards and backwards. For a string to be rearranged into a palindrome, at most one character can have an odd frequency. In other words, if we denote the number of characters with odd occurrences by odd_count, then the condition is given by: $$\text{odd_count} \le 1.$$

Your task is to read the input string from standard input and output True if the string can be rearranged into a palindrome, otherwise output False.

inputFormat

The input consists of a single line containing a non-empty string s of lowercase English letters. There are no spaces in the string.

outputFormat

Output a single line with True if the string can be rearranged into a palindrome, or False otherwise.## sample

civic
True