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
import string

w = raw_input()
d = dict.fromkeys(string.ascii_lowercase, 0)
for i in range(len(w)):
    d[w[i]] += 1

    
finalprint = "Yes"    

for key, value in d.iteritems():
    bool = value % 2
    if bool == 0:
        continue
    else:
        finalprint = "No"
        break

print finalprint