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()

b = []
for i in range(30):
	b.append(0)

for i in a:
	b[ord(i) - ord("a")] += 1

c = 0
for i in b:
	if i % 2 != 0:
		c = 1
		break
if c == 0:
	print "Yes"
else:
	print "No"