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 <stdbool.h>
int main() {
	char w[100],a;
	bool bf = 0;
	int c = 0;
	scanf("%s", w, 100);

	//アルファベット順
	for (int i = 0;w[i] != '\0';i++) {
		for (int ii = i + 1;w[ii] != '\0';ii++) {
			if (w[i] > w[ii]) {
				a = w[i];
				w[i] = w[ii];
				w[ii] = a;
			}
		}
	}
	//カウント 
	for (int i = 0;w[i] != '\0';i++) {
		for (int ii = 0;w[ii] != '\0';ii++) {
			if (w[i] == w[ii]) c++;
		}
		if (c % 2 == 0) bf = 1;
		else {
			bf = 0;
			break;
		}
		c = 0;
	}
	if (bf == 1) printf("Yes\n");
	else printf("No\n");
}