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.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Map.Entry;

/**
 * Main
 */
public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] s = sc.next().split("");
    
        Map<String,Integer> map = countMultiple(s);
        final String result = isBeanty(map)? "Yes" : "No";
        System.out.println(result);
        sc.close();    
    }
    
    public static boolean isBeanty(Map<String,Integer> map){
        for (Entry<String,Integer> t: map.entrySet()) {
            if(t.getValue()%2 == 1) {
                return false;
            }
        }
        return true;
    }

    public static Map<String,Integer> countMultiple(String[] chars){
        Map<String,Integer> map = new HashMap<>();
        for (String s : chars) {
            if(map.containsKey(s)) {
                map.put(s, map.get(s) + 1);
            }else{
                map.put(s, 1);
            }
        }
        return map;
    }
}