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 C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>

int main(){
  char w[110];
  int num[110];
  int i, k, count;
  int seki = 1;
  scanf("%s", w);

  for (i=0; w[i] != '\0'; i++){
    count = 1;
    if(w[i] != 'A'){
      for(k=i+1; w[k] != '\0'; k++){
        if(w[i] == w[k]){
          count++;
          w[k] = 'A';
        }
      }
      num[i] = count;
    }else{
      num[i] = 2;
    }
  }

  for(i=0; w[i] != '\0'; i++){
    if (num[i] == 1) {
      seki = 1;
      break;
    }else{
      seki = seki * num[i];
    }
  }

  if(seki % 2 == 0){
    printf("Yes\n");
  }else{
    printf("No\n");
  }

  return 0;
}