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 <string.h>

int main(void){
	
	char A[27] = "abcdefghijklmnopqrstuvwxyz";
	char w[100];
	int count = 0, NO = 0;
	int len;

	scanf("%s", w);

	len = strlen(w);

	for (int i = 0; i < 27; i++) {
		for (int j = 0; j <len; j++) {
			if (A[i] == w[j])count++;
		}
		if (count % 2 != 0)NO++;
		else count = 0;
	}

	if (NO != 0)printf("No\n");
	else printf("Yes\n");

	return 0;

}