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())
flagArray = [True for i in range(26)]
for w in W:
	flagArray[ord(w)-97] = not(flagArray[ord(w)-97])
flag = True
for f in flagArray:
	if not f:
		print "No"
		flag = False
		break
if flag:
	print "Yes"