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.*;

public class Main {
	public static void main(String[] args) {      
      Scanner sc = new Scanner(System.in);
      String w = sc.next();
      char[] a = {'a', 'b', 'c','d','e','f', 'g', 'h', 'i', 'j', 'k', 'l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
      int[] check = new int[26];
      int out =0;
      for (int j =0; j<26; j++) {
        for (int i =0; i< w.length(); i++) {
          if (w.charAt(i) == a[j]) check[j]++;
        }
      }
      for (int i=0 ; i<26; i++) {
        if(check[i] % 2 != 0) out++;
      }
      if (out != 0) {
        System.out.println("No");
      } else {
        System.out.println("Yes");
      }
    }
}