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_list = []

(w.size).times do |i|
  w_list.push(w[i])
end

w_list.sort!
w_list.push("A")

tmp = ""
cnt = 0
h_flag = true
w_list.each do |c|
  #p c
  if(tmp!=c)then
    if(!h_flag)then
      if(cnt%2!=0)then
        puts "No"
        exit
      end
    else
      h_flag = false
    end
    cnt  = 1
  else
    cnt += 1
  end
  tmp = c
end

puts "Yes"