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;

fn is_beautiful(s: &str) -> bool {
    let cnts = count_occurences(s);
    is_beautiful_occurences(cnts)
}

fn count_occurences(s: &str) -> Vec<usize> {
    let mut cnts = vec![0; 26];
    for b in s.as_bytes() {
        cnts[(b - 97) as usize] += 1;
    }
    cnts
}

fn is_beautiful_occurences(cnts: Vec<usize>) -> bool {
    for c in cnts {
        if c % 2 != 0 {
            return false;
        }
    }
    true
}

fn main() {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let s = input.split_whitespace().next().unwrap();
    if is_beautiful(s) {
        println!("Yes");
    } else {
        println!("No");
    }
}