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 Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.util.*;
import java.util.Map.Entry;
public class Main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String w = in.next();
		
		HashMap<Character,Integer> hm = new HashMap<Character,Integer>();
		for (int i=0;i<w.length();i++) {
			if(hm.containsKey(w.charAt(i))) {
                  hm.put(w.charAt(i), hm.get(w.charAt(i))+1);}
              else { hm.put(w.charAt(i), 1);}}
		
		boolean flag = true;
		for (Entry<Character, Integer> entry : hm.entrySet()) {
            int value = entry.getValue(); 
            char key = entry.getKey(); 
            if (value%2!=0) {
            	flag = false;
            	break;}}
            
            if (flag) {
            	System.out.println("Yes");}
            else {
            	System.out.println("No");}
            }
		}