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: Wrong Answer)

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

#define W 100
#define CNT 26

int main()
{
	char w[W];
	unsigned short cnt[CNT];
	unsigned int i;
	unsigned int mod = 0;

	for (i = 0; i < CNT; i++) {
		cnt[i] = 0;
	}

	scanf("%s", w);
	for (i = 0; i < strlen(w) - 1; i++) {
		cnt[w[i] - 'a']++;
	}
	for (i = 0; i < CNT; i++) {
		if (cnt[i]) {
			mod += cnt[i] % 2;
		}
	}

	if (mod) {
		printf("Yes\n");
	}
	else {
		printf("No\n");
	}

	return 0;
}