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.42.0) (judge verdict: Accepted)

use proconio::input;
use proconio::marker::Chars;

fn main() {
    input! {
        w: Chars,
    }

    solve(&w);
}

fn solve(w: &Vec<char>) {
    let mut cnt = [0; 26];
    for c in w {
        match c {
            'a' => cnt[0] += 1,
            'b' => cnt[1] += 1,
            'c' => cnt[2] += 1,
            'd' => cnt[3] += 1,
            'e' => cnt[4] += 1,
            'f' => cnt[5] += 1,
            'g' => cnt[6] += 1,
            'h' => cnt[7] += 1,
            'i' => cnt[8] += 1,
            'j' => cnt[9] += 1,
            'k' => cnt[10] += 1,
            'l' => cnt[11] += 1,
            'm' => cnt[12] += 1,
            'n' => cnt[13] += 1,
            'o' => cnt[14] += 1,
            'p' => cnt[15] += 1,
            'q' => cnt[16] += 1,
            'r' => cnt[17] += 1,
            's' => cnt[18] += 1,
            't' => cnt[19] += 1,
            'u' => cnt[20] += 1,
            'v' => cnt[21] += 1,
            'w' => cnt[22] += 1,
            'x' => cnt[23] += 1,
            'y' => cnt[24] += 1,
            'z' => cnt[25] += 1,
            _ => {}
        }
    }
    for num in cnt.iter() {
        if num % 2 == 1 {
            println!("No");
            return;
        }
    }
    println!("Yes");
}