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

public class Main {

	public static void main(String[] args) {
		try (Scanner sc = new Scanner(System.in);) {
			String w = sc.next().toLowerCase();
			String[] y = new String[w.length()];

			if (w.length() % 2 == 0) {
				for (int i = 0; i < w.length(); i++) {
					y[i] = String.valueOf(w.charAt(i));
				}
				Arrays.sort(y);

				int ans = 0;

				for (int i = 0; i < w.length() / 2; i++) {

					if (y[2 * i].equals(y[2 * i + 1])) {
						ans += 0;
					} else {
						ans += 1;
					}
				}

				if (ans == 0) {
					System.out.println("Yes");
				} else {
					System.out.println("No");
				}

			} else {

				System.out.println("No");

			}
		}
	}
}