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>

//Compiler version gcc  6.3.0

int main()
{
  char a[100],n[1],b[4];
  int i,s,t;
  b[0]='y';
  b[1]='e';
  b[2]='s';
  b[3]='\0';
  scanf("%s",&a);
  
  for(i=0;a[i];i++)
  {
    n[1]=a[i];
    for(t=0;a[t];t++)
    {
      if(n[1]==a[t])
      s++;
    }
    if(s%2!=0)
    {
    b[0]='n';
    b[1]='o';
    b[2]='\0';
    break;
    }
  }
  
  printf("%s",b);
  
  return 0;
}