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 OCaml (4.10.0) (judge verdict: Accepted)

Scanf.scanf "%s" (fun w ->
    let h = Array.make 26 0 in
    String.iter (fun v -> let q = int_of_char v - 97 in h.(q) <- h.(q) + 1) w;
    print_endline @@ if Array.fold_left (lor) 0 h mod 2 = 0 then "Yes" else "No"
)