Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

abaccaba

Sample Output 1

Yes

a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.

Sample Input 2

hthth

Sample Output 2

No

Solution in Ruby (2.3.3) (judge verdict: Time Limit Exceeded)

s=gets.chomp.split("")
lists=[]
lists.push(s[0])
s.each{|i|
	lists.each{|j|
		if i==j then
			next
		else
			lists.push(i)
		end
	}
}
 
 
flag=0
lists.each{|i|
	count=0
	s.each{|j|
		if i==j then
			count+=1
		end
	}
	if count%2!=0 then
		puts("No")
		flag=1
		break
	end
	
}
if flag==0 then
	puts("Yes")
end