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

alpha = [chr(i) for i in range(97,97+26)]
cnt = [0]*26

for i in w:
    cnt[ord(i)-97] += 1
res = 'Yes'
for i in cnt:
    if i%2 != 0:
        res = 'No'
print res