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
w = str(raw_input())

dic = {"def":0}
for s in w:
    if s in dic.keys():
        dic[s] += 1
    else:
        dic.update({s:1})

flag = 0

for value in dic.values():
    if value%2 == 0:
        pass
    else:
        flag = 1

if flag == 0:
    print "Yes"
else:
    print "No"
