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: Wrong Answer)

import java.util.*;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		String[] strArray = str.split("");
		int count = 0;

		for (int i = 0; i < strArray.length; i++) {
			count = 0;
		    for(int j = 0; j < strArray.length; j++) {
		    	if(!(strArray[i].equals(strArray[j]))) {
		    		count++;
		    	}
		    }
		    if(count % 2 == 0) {
		    	str = "Yes";
		    }else{
		    	str = "No";
		    	break;
		    }
		}
		System.out.println(str);
	}

}