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.*;

public class Main {
	private static String w;
	private static void input() {
		Scanner sc = new Scanner(System.in);
		w = sc.next();
	}

	public static void main(String[] args) {
		input();
		char[] alphabet = new char[26];
		String str = "abcdefghijklmnopqrstuvwxyz";
		for(int i = 0; i < 26; i++)
			alphabet[i] = str.charAt(i);
		int[] counter = new int[26];
		for(int i = 0; i < w.length(); i++) {
			for(int j = 0; j < 26; j++) {
				if(w.charAt(i) == alphabet[j])
					counter[j]++;
			}
		}
		boolean beautiful = true;
		for(int i = 0; i < 26; i++)
			beautiful = beautiful && (counter[i]%2 == 0);
		System.out.println(beautiful ? "Yes" : "No");
	}
}