Let
s be a string consisting of lowercase letters. We will call a string
s beautiful if each lowercase letter of the English alphabet occurs in it an even number of times. Given the string
s, determine if it is beautiful.
Input
The input is a string. The length of the string is not zero and not more than 100 characters. The string consists only of lowercase English letters (
a-
z).
Imprint
Print
Yes if
s is pretty, otherwise print
No.
Examples
| # |
Input |
Output |
| 1 |
abaccaba |
Yes |
| 2 |
hthth |
No |