Let w be a string consisting of lowercase letters. We will call w beautiful if the following condition is satisfied:

* Each lowercase letter of the English alphabet occurs even number of times in w.



You are given the string w. Determine if w is beautiful.

Constraints

* 1 \leq |w| \leq 100
* w consists of lowercase letters (`a`-`z`).

Input

The input is given from Standard Input in the following format:


w


Output

Print `Yes` if w is beautiful. Print `No` otherwise.

Examples

Input

abaccaba


Output

Yes


Input

hthth


Output

No
s = raw_input()
word_list = {}
for i in s:
    if not word_list.has_key(i):
        word_list[i] = 1
    else:
        word_list[i] += 1

flag = 0
for i in word_list.values():
    if i % 2 == 1:
        flag = 1

if flag == 1:
    print 'No'
else:
    print 'Yes'
