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>

int main(){
  char S[110];
  int i,length;
  length = 0;
  scanf("%s",S);
  for(i=0;i<=99;i++)
    if(S[i]) length++;
  for(i=0;i<=length-1;i++)
    S[i] -= 'a';
  int number[110] = {0};
  for(i=0;i<=length-1;i++)
    number[S[i]]++;
  for(i=0;i<=length;i++){
    if(number[i]%2 == 1){
    printf("No");
    goto NO;
    };
    };
  printf("Yes");
  NO:;
}