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)

fn main() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    let w = s.trim();

    let mut count =  [0; 26];
    let n: u8 = "a".as_bytes()[0];
    for i in 0..w.len() {
        count[{w.chars().nth(i).unwrap().to_string().as_bytes()[0] - n} as usize] += 1;
    }
    let mut btfl = true;
    for i in 0..count.len() {
        if count[i] % 2 == 1 {btfl = false}
    }
    println!("{}", if btfl {"Yes"} else {"No"});
}