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 w[101];
    scanf("%s",w);
    int a[26];
    for(int i=0;i<26;i++)
        a[i]=0;
    for(int i=0;i<101;i++){
        if(w[i]=='\0')    break;
        for(int j=0;j<26;j++){
            if(w[i]=='a'+j)    a[j]++;
        }
    }

    for(int i=0;i<26;i++){
        if(a[i]%2==1){
            printf("No\n");
            return 0;
        }
    }

    printf("Yes\n");


}