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: Accepted)

#include<stdio.h>
#include<string.h>
int main()
{
  char w[100];
  char moji;
  int con[100]={0},r=0,flag=0;
  
  scanf("%s",w);
  
  for(int i=0;i<strlen(w)-1;i++){
    for(int j=i+1;j<strlen(w);j++){
      if(w[i]>w[j]){
        moji=w[i];
        w[i]=w[j];
        w[j]=moji;
      }
    }
  }
  
  for(int i=0;i<strlen(w);i++){
    if(w[i]==w[i+1]) con[r]++;
    else {
      con[r]++;
      r++;
    }
  }
  for(int i=0;i<100;i++){
    if(con[i]%2!=0){
      flag=1;
      break;
    }
  }
  if(flag==0) printf("Yes");
  else printf("No");
    
  return 0;
}