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>

int main(void)
{
	char w[101];
	int i, j, count_1 = 0;
	
	scanf("%s", w);
	
	for(i = 0; w[i] != '\0'; i++) {
		if(w[i] == ' ') {
			continue;
		}
		count_1++;
		for(j = i + 1; w[j] != '\0'; j++) {
			if(w[i] == w[j]) {
				count_1++;
				w[j] = ' ';
			}
		}
		if(count_1 % 2 != 0) {
			count_1++;
			printf("No");
			break;
		}
		count_1 = 0;
	}
	if(count_1 == 0) {
		printf("Yes");
	}
	return 0;
}