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
a = raw_input().strip()
l = [0]*26
for x in a:
	if l[ord(x)-97] == 1:
		l[ord(x)-97] = 0
	else:
		l[ord(x)-97] =1
if max(l) == 0:
	print('Yes')
else:
	print('No')