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;

fn read<T: std::str::FromStr>()-> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();

    s.trim().parse().ok().unwrap()
}

fn main(){

    let s: String = read();

    let mut hashMap: HashMap<char, i32> = HashMap::new();

    for c in s.chars(){

        let count = hashMap.entry(c).or_insert(0);
        *count += 1;
    }

    let mut is_beautiful = true;

    for (c, v) in hashMap.iter() {
        if v % 2 == 1 {
            is_beautiful = false;
            break;
        }
    }

    if is_beautiful {
        println!("Yes")
    } 
    else {
        println!("No")
    }
}