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 <stdlib.h>
#include <ctype.h>
#include <math.h>

int main() {

    char w[101];
    scanf("%s", w);

    int a[26];
    int l = strlen(w);

    //初期化
    for (int k = 0; k < 26; k++) {
        a[k] = 0;
    }

    for (int i = 0; i < l; i++) {

        //printf("%c %d\n", w[i], w[i]-'A'-32);
        int num = w[i] - 'A' - 32;
        a[num] += 1;

    }

    for (int j = 0; j < 26; j++) {
        int cnt = a[j];
        if (cnt % 2 != 0) {
            printf("No");
            return 0;
        }
    }
    printf("Yes");

    return 0;

}