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: Accepted)

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        Map<Character, Integer> dic = new HashMap<>();
        String w = in.next();
        for (int i = 0; i < w.length(); i++){
            if (dic.containsKey(w.charAt(i))){
                dic.put(w.charAt(i), dic.get(w.charAt(i)) +1);
            }
            else {
                dic.put(w.charAt(i), 1);
            }
        }
        for (Character c: dic.keySet()){
            if (dic.get(c) %2 != 0){
                System.out.println("No");
                return;
            }
        }
        System.out.println("Yes");
    }
}