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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main{
	public static void main(String[]args) {
		Scanner sc = new Scanner(System.in);
		String a = sc.next();
		int nagasa = a.length();
		boolean result = true;
		//while(true) {
			for(int i = 0; i < nagasa; i++) {
				int count = 0;
				char ans = a.charAt(i);
				for(int j = 0; j < nagasa; j++) {
					if(ans == a.charAt(i)) {
						count += 1;
						}
					}
				if(count % 2 == 1) {
					result = false;
				}
			}
		if(result == false) {
			System.out.println("No");
		}else {
			System.out.println("Yes");
		}
	}
}