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()
lut = {}

for c in s:
    if lut.has_key(c) :
        lut[c] += 1
    else:
        lut[c] = 1

ret = "Yes"
for c in range(ord('a'),ord('z')+1):
    c = chr(c)
    if lut.has_key(c) and lut[c] % 2 != 0:
        ret = "No"
        break

print ret