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: Time Limit Exceeded)

#include <stdio.h>

int main(void){
	char w[128], ch = 'a' , y_n[4];
	int ct=0,i=0;
	
	scanf("%s", w);
	
	while(1){
		while(w[i] == NULL){
			if(w[i] == ch) ct++;
			i++;
		}
		if(ct%2 == 1){
			printf("No\n");
			break;
		}
		else if(ch == 'z'){
			printf("Yes\n");
			break;
		}
	}
	
	return 0;
}