Palindrome Permutation Check

You are given a string s. Your task is to determine if any permutation of s can form a palindrome.

A palindrome is a word that reads the same backward as forward. In other words, a string s can be rearranged to form a palindrome if and only if the number of characters with an odd frequency is less than or equal to 1, i.e., \(\text{odd\_count} \le 1\).

For example, for the string "civic", the answer is "YES" because it is already a palindrome. Conversely, for the string "hello", the answer is "NO".

Read the input from stdin and print the output to stdout.

inputFormat

The input consists of a single line containing the string s. The string is non-empty and may contain any printable characters. Leading and trailing spaces should be considered as part of the string.

outputFormat

Output a single line with "YES" if the given string can be rearranged to form a palindrome, or "NO" otherwise.

civic

YES