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)


def char_to_index(char)
  char.ord - "a".ord
end

def beautiful?(string)
  count = Array.new(char_to_index("z") + 1){ 0 }
  string.each_char{ |char| count[char_to_index(char)] += 1 }
  count.each do |n|
    return false unless n % 2 == 0
  end
  return true
end

puts beautiful?(gets.strip) ? "Yes" : "No"