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>
#include<math.h>
int ara[100000];
char ara1[100000];
int main()
{
    int i,j,k,a,b,h,ln,v=0;
    char ch;
    gets(ara1);
    ln=strlen(ara1);
    for(i=0;i<ln;i++)
    {
        for(ch='a',j=1;ch<='z';ch++,j++)
        {
            if(ara1[i]==ch)
            {
                ara[j]++;
                break;
            }
        }
    }
    for(i=1;i<=26;i++)
    {
        if(ara[i]%2!=0)
        {
            v=1;
            break;
        }
    }
    if(v==1)
    {
        printf("No\n");
    }
    else
    {
        printf("Yes\n");
    }
    return 0;
}