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

public class Main {
	public static void main(String[] args) throws IOException {
		String input;
		try(BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
			input = String.valueOf(br.readLine());
		}

		Map<String, Integer> count = new HashMap<String, Integer>();

		for(int i = 0; i < input.length(); i++) {
			String chr = input.substring(i, i+1);
			if (count.containsKey(chr)) {
				count.put(chr, count.get(chr) + 1);
			} else {
				count.put(chr, 1);
			}
		}

		for(Entry<String, Integer> entry: count.entrySet()) {
			Integer value = entry.getValue();
			if(value % 2 ==1) {
				System.out.println("No");
				return ;
			}
		}
		System.out.println("Yes");
	}
}