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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Main {
  public static void main(String[] args) throws IOException{
    BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
    String input = bf.readLine();
    System.out.println(check(input));
    bf.close();
  }
  static String check(String s){
    //文字列sの最初の文字について、偶数個あったら、trueを返す。
    if (s.length() == 0) {
      return "Yes";
    }
    char[] cList = s.toCharArray();
    char checkChar = cList[0];
    int count = 0;
    StringBuilder sb = new StringBuilder();
    for (char c : cList) {
      if (c == checkChar) {
        count++;
      } else {
        sb.append(c);
      }
    }
    if (count % 2 == 0) {
      return check(sb.toString());
    } else {
      return "No";
    }
  }
}