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: Accepted)

w = gets.chomp
w_hash = {}

(0..w.size-1).each do |i|
  w_hash.key?(w[i]) ? (w_hash[w[i]] += 1) : (w_hash[w[i]] = 1)
end

w_hash.select{|key,val| val % 2 == 1}.size == 0 ? (puts "Yes") : (puts "No")