Rearrange to Palindrome

You are given a string s. Determine whether any permutation of the string can form a palindrome.

A palindrome is a word or sequence that reads the same backward as forward. In order for a string to be rearranged into a palindrome, it must have at most one character with an odd frequency count. Otherwise, it is impossible to arrange it into a palindrome form.

For example, one can rearrange the string "ivicc" into "civic", which is a palindrome, whereas the string "hello" cannot form any palindrome rearrangement.

Write a program that reads the input string from standard input and outputs either "YES" or "NO" to standard output.

inputFormat

The input consists of a single non-empty string s which contains only printable characters. The string is provided via standard input.

outputFormat

Output a single line containing "YES" if it is possible to rearrange s into a palindrome, or "NO" otherwise. The output should be written to standard output.

civic

YES