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 (Clang 3.8.0) (judge verdict: Accepted)

#include <stdio.h>
#include <string.h>

int main()
{

    char original[100];
    scanf("%s", original);
    int ascii[130];

    for (int i = 0; i < 130;i++){
        ascii[i] = 0;
    }

        int len = strlen(original);

    for (int i = 0; i < len; i++)
    {
        ascii[(int)original[i]]++;

    }
    int yes = 1;
    for (int i = 0; i < 130; i++)
    {
        if(ascii[i]%2!=0){
            yes = 0;
            break;
        }
    }
    if(yes==1)
        printf("Yes");
    else
    {
        printf("No");
    }

    printf("\n");
}