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)

#![allow(unused_imports)]
// use itertools::Itertools;
use proconio::{input, marker::*};

fn main() {
    input! {
        w: Chars
    };
    let mut arr = vec![0; 1usize + b'z' as usize];
    for c in w {
        arr[c as usize] += 1;
    }
    for c in b'a'..=b'z' {
        if arr[c as usize] % 2 != 0 {
            println!("No");
            return;
        }
    }
    println!("Yes");
}