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 <stdlib.h>
#include <stdio.h>

int main(int argc, char **argv) 
{	
	char w[100];
	scanf("%s", w);
	
	/* a to z corresponds to ACSII 97 to 122 */
	int alphabet = 123, asciiVal;
	int arr[alphabet];
	
	/* initialize arr[] to 0 */
	for (int i = 0; i < alphabet; i++) {
		arr[i] = 0;
	}
	
	/* increment corresponding ACSII values */
	for (int i = 0; w[i] != '\0'; i++) {
		asciiVal = w[i];
		arr[asciiVal]++;
	}
	
	for (int i = 0; i < alphabet; i++) {
		if (arr[i] % 2 != 0) {
			printf("No\n");
			return 0;
		}
	}
	
	printf("Yes\n");
	return 0;
}