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() {
	int loop;
	char w[101];
	int sum[26];
	int i = 0;
	int len;
	int loop1, loop2;

	scanf("%s", &w);
	len = strlen(w);
	for (loop = 0; loop < 26; loop++)
		sum[loop] = 0;

	for (loop1 = 0; loop1 < len; loop1++) 
		for (loop2 = 0; loop2 < 26; loop2++) {
			if (w[loop1] == loop2 + 97) sum[loop2]++;
		}
	
	for (loop = 0; loop < 26; loop++)
		if (sum[loop] % 2 != 0) i++;

	if (i == 0) printf("Yes");
	else printf("No");
	
}