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>
int main()
{
    char c1,a1[101];
    int a,b,d,i,l;
    gets(a1);
    l=strlen(a1);

    for(c1='a';c1<=122;c1++)
    {
        d=0;
        for(i=0;i<l;i++)
        {
            if (c1==a1[i])
                d=d+1;
        }
        if(d%2 != 0)
        {
            printf("No");
            break;
        }
    }
    if(d%2 ==0)
        printf("Yes");
    return 0;
}