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.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);

		String keyBoard = sc.next();
		int inputSize = keyBoard.length();
		boolean beautifulFlag = true;

		List<String> wordList = new ArrayList<String>();

		for (int i = 0; i < inputSize; i++) {
			wordList.add(keyBoard.substring(i, i+1));

		}

		Collections.sort(wordList);

		for (int i = 0; i < wordList.size(); i++) {
			String word = wordList.get(0);

			int wordCount = wordList.lastIndexOf(word) + 1;

			if (wordCount % 2 != 0) {
				System.out.println("No");
				beautifulFlag = false;
				break;
			}

			for (int j = 0; j < wordCount; j++) {
				wordList.remove(0);
			}
		}

		if (beautifulFlag) {
			System.out.println("Yes");

		}

		sc.close();
	}
}