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(void){
    
    int i,j;
    char a[101],b[27]={0};
    
    scanf("%s",a);
    
    for(i=0;i<strlen(a);i++){
        for(j=0;j<26;j++){
            if(a[i]-'a'==j){
                b[j]++;
            }
        }
    }
    
    for(i=0;i<26;i++){
        if(b[i]%2!=0){
            printf("No");
            return 0;
        }
    }
    printf("Yes\n");
}