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: Runtime Error)

#include<stdio.h>
#include<string.h>

int main(void){

  char str[101];
  char alpha[]="abcdefghijklmnopqrstuvwxyz";
  int num[26]={0};
int i, j;

scanf("%s", str);
for(i=0; i<strlen(alpha); i++){
  for(j=0; j<strlen(str); j++){
  if(alpha[i]==str[j]){
    num[i]=num[i]+1;
  }
  }
}

for(i=0; i<26; i++){
  if(num[i]%2!=0){
    printf("No\n");
    return 1;
  }
}

printf("Yes\n");

return 0;
}