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 Perl (v5.18.2) (judge verdict: Wrong Answer)

$s = STDIN;
@t = split "", $s;
map{$h{$_}++}@t;

#@odd = grep{$h{$_}%2 == 1}keys%h;

#$odds = 0;
for(keys %h){
	$odds++ if $h{$_}%2 == 1;
}

if($odds == 0){
	print"Yes\n";
}else{
	print"No\n";
}