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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>
 
int com_asc_int(const void *n1,const void *n2){
   if(*(char*)n1 > *(char*)n2)return 1;
   else if(*(char*)n1 < *(char*)n2)return -1;
   else return 0;
}
 
int main(){
   char w[101];scanf("%s",w);
   qsort(w,strlen(w),sizeof(char),com_asc_int);
   int c = 0;
   for(int i = 0;i < strlen(w)-1;i++){
      if(w[i] == w[i+1])c++;
      else c--;
   }
   if(!(c%2 == 0))printf("Yes\n");
   else printf("No\n");
}