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 Rust (1.15.1) (judge verdict: Accepted)

use std::collections::HashMap;
use std::io::stdin;

fn main() {
    let mut s = String::new();
    stdin().read_line(&mut s).ok();
    let w = s.trim();
    let mut d = HashMap::new();

    for e in w.chars() {
        *d.entry(e).or_insert(0) += 1;
    }

    println!(
        "{}",
        if d.iter().all(|e| *e.1 % 2 == 0) {
            "Yes"
        } else {
            "No"
        }
    );
}