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::io;
use std::collections::HashMap;

fn main()
{
    let mut w = String::new();
    io::stdin().read_line(&mut w).unwrap();

    let mut map = HashMap::new();

    for c in w.trim().chars()
    {
        let n = map.entry(c).or_insert(0);
        *n += 1;
    }

    match map.values().find(|&x| x%2 != 0)
    {
        Some(_) => println!("No"),
        None    => println!("Yes")
    }
}