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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

// B - 美しい文字列 / Beautiful Strings
// https://atcoder.jp/contests/abc044/tasks/abc044_b
public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        char[] w = scanner.next().toCharArray();
        scanner.close();

        if (w.length % 2 == 1) {
            System.out.println("No");
            return;
        }

        Map<Character, Integer> map = new HashMap<>();

        for (char c : w) {
            map.computeIfPresent(c, (k, v) -> v++);
        }

        for (Integer v : map.values()) {
            if (v % 2 != 0) {
                System.out.println("No");
                return;
            }
        }

        System.out.println("Yes");
    }
}