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();

    sc.close();

    String[] W = w.split("");
    
    HashMap<String, Integer> hashMap = new HashMap<>();

    for (int i = 0; i < W.length; i++) {
      if (hashMap.containsKey(W[i])) {
        int v = hashMap.get(W[i]);
        hashMap.put(W[i], v + 1);
      } else {
        hashMap.put(W[i],1);
      }
    }

    boolean valid = true;

    for (int i = 0; i < W.length; i++) {
      int v = hashMap.get(W[i]);
      if (v % 2 != 0) {
        valid = false;
        break;
      }
    }

    if (valid) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }

  }

}