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 Julia (0.5.0) (judge verdict: Accepted)

w = chomp(readline())
dict = Dict()
for i in 1:length(w)
    key = string(w[i])
    dict[key] = get(dict,key,0) + 1
end

mod_list = []
for key in keys(dict)
    mod_list = push!(mod_list,mod(dict[key],2))
end
sorted = sort(mod_list,rev=true)

if sorted[1] == 0
    println("Yes")
else
    println("No")
end