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 ara[500];
int main()
{
    int a,i,j,len=0,l;
    char s[500];
    char alpha[]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','\0'};
    scanf("%s",s);
    l=strlen(s);
    for (i=0;i<l;i++){
        for(j=0;j<26;j++){
            if(s[i]==alpha[j]){
                ara[j]++;
            }
        }
    }

    for(j=0;j<26;j++){
        if(ara[j]%2==0){
            len++;
        }
    }
    if(len==26) printf("Yes\n");
    else printf("No\n");


    return 0;
}