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 = raw_input()
wl = []
for i in range(0, len(w)):
	wl.append(w[i])
wl.sort()

if len(wl) % 2 != 0: print("No")
else:
	flag = True
	for i in range(0, len(wl)/2):
		if wl[2*i] != wl[2*i+1]:
			flag = False
			break
	if flag: print("Yes")
	else: print("No")