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 w[101];
	char check[101];
	int i,j,count=1;
	int flag=0;
	
	for(i=0; i <= 100; i++) w[i] = '\0';
	scanf("%s",w);
	
	
	for(i=0; i < 100; i++){
		if(w[i] == 'Z') flag = 1;
		for(j=i+1; j < 100; j++){ 
			if(w[i] == w[j]){
					if(flag == 1){
						 break;
					}
					count++;
					w[j] = 'Z';
			}
			
			if( (count % 2) == 0){
				check[i] = 'O';	
			}else if((count % 2 != 0) && flag != 1){
				check[i] = 'N';
			}else{
			}
			
		}
		
		
		flag = 0;
		count = 1;
	}
	
	flag = 0;
	for(i=0; i < 100; i++){
		if(check[i] == 'N') flag = 1;
	}
	
	if(flag == 0){
		printf("Yes\n");
	}else{
		printf("No\n");
	}
	
	
	return 0;
}