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

def average(N):
    if N == "":
        return 'Yes'

    count = 0
    for i in range(len(N)):
        if N[0] == N[i]:
            count+=1

    if count % 2 == 1:
        return 'No'

    N = N.replace(N[0],"")
    return average(N)

print average(N)