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 <stdbool.h>

int main(void)
{
    char w[101];
    char tmp;
    int i, j;
    int count = 0;
    bool flag = false;
    scanf("%s", w);
    for (i=strlen(w)-2; i>=0; i--)
    {
        for (j=0; j<=i; j++)
        {
            if (w[j] > w[j+1]) {
                tmp = w[j+1];
                w[j+1] = w[j];
                w[j] = tmp;
            }
        }
    }
    for (i=0; i<=strlen(w)-2; i++)
    {
        count ++;
        if (w[i] != w[i+1] && count%2 != 0) {
            flag = true;
            break;
        }
    }
    if (flag) {
        printf("No\n");
    } else {
        printf("Yes\n");
    }
    return 0;
}