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

fn read<T: FromStr>() -> T {
    let input = stdin();
    let input = input.lock();
    let token: String = input
            .bytes()
            .map(|c| c.expect("conversion error") as char)
            .skip_while(|c| c.is_whitespace())
            .take_while(|c| !c.is_whitespace())
            .collect();

    token.parse().ok().expect("read error")
}

fn main() {
    // 各文字の登場回数を記録するハッシュテーブルを作成
    let mut cnt = HashMap::new();

    //文字を入力し、順にcntに格納していく
    let w: String = read();
    let cs: Vec<char> = w.chars().collect();
    for i in 0..w.chars().count() {
        *cnt.entry(cs[i]).or_insert(0) += 1;
    }

    // valuesに奇数があればNo
    if cnt.values().all(|v| v % 2 == 0) {
        println!("Yes");
    } else {
        println!("No");
    }
}