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(){
	int i,n;
	char moji[110];
	int count[100];
	for(i=0;i<100;i++){
		count[i]=0;
	}
	scanf("%s",moji);
	for(i=0;moji[i]!='\0';i++){
		n = moji[i] - 'a';
		//printf("%d\n",n);
		count[n]++;
	}
	i=0;
	while(i<100){
		//printf("count[%d]=%d\n",i,count[i]);
		if(count[i]%2==1){
			printf("No\n");
			break;
		}

		i++;
	}
	if(i==100){
		printf("Yes\n");
	}
	return 0;
}