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

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		String w = scan.nextLine();
		String[] wArray = new String[w.length()];
		
		for(int i = 0; i < w.length(); i++) {
			wArray[i] = w.substring(i, i + 1);
		}
		
		List<String> wList = new ArrayList<String>(Arrays.asList(wArray));
		List<String> wHashList = new ArrayList<String>(new HashSet<>(wList));
		int sum = 0;
		
		for(int i = 0; i < wHashList.size(); i++) {
			for(int j = 0; j < w.length(); j++) {
				if(wHashList.get(i).equals(w.substring(j, j + 1))) {
					sum++;
				}
			}
			if(sum % 2 == 1) {
				break;
			} else {
				sum = 0;
			}
		}
		
		if(sum % 2 == 1) {
			System.out.println("No");
		} else {
			System.out.println("Yes");
		}
		
		scan.close();
	}

}