Rearrange to Palindrome

Given a string s consisting of lowercase letters, determine whether its characters can be rearranged to form a palindrome.

A palindrome is a word that reads the same backward as forward. One way to check this is by ensuring that at most one character appears an odd number of times. More formally, let \( f(c) \) denote the frequency of character \( c \) in the string. The string can be rearranged into a palindrome if and only if the number of characters \( c \) for which \( f(c) \) is odd satisfies \( \#\{c : f(c) \text{ is odd}\} \leq 1 \).

Your task is to write a program that reads a single string from standard input and prints yes if the string can be rearranged to form a palindrome, or no otherwise.

inputFormat

The input consists of a single line containing a string s made up of lowercase letters. The string may be empty.

outputFormat

Output a single line containing either yes or no depending on whether the characters of the string can be rearranged to form a palindrome.

civic

yes