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()
{
long long int n[25]={0},k,x,y,sum=0,i,flag=0;
char a[1000];
gets(a);
flag=0;
for(i=0;i<strlen(a);i++)
{
    n[a[i]-97]++;
}
for(i=0;i<26;i++)
{
    if(n[i]%2!=0 && n[i]>=1)
    {
       flag=1;
    }
}
if(flag==1)
{
    printf("No");
}else{
    printf("Yes");
}
    return 0;
}