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

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		String w = scanner.next();
		Map<String, Integer> appear_num = new HashMap<String, Integer>();
		for (int i = 0; i < w.length(); i++) {
			if(!appear_num.containsKey(w.substring(i,i+1))) {
				appear_num.put(w.substring(i,i+1), 1);
			}
			else {
				appear_num.put(w.substring(i,i+1),
						appear_num.get(w.substring(i,i+1))+1);
			}
		}

		for(Map.Entry<String,Integer> entry : appear_num.entrySet()) {
			if(entry.getValue() % 2 !=0) {
				System.out.println("No");
				System.exit(0);
			}
		}

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