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()
{
	char str[100] = {0};
	_Bool flag = 1;
	int count = 0;
	
	scanf("%s", str);
	for(char ch = 97; ch < 'z'; ch++){
		for(int i = 0; i < strlen(str); i++){
			if(str[i] == ch){
				count++;
			}
		}
		
		if(count % 2){
			flag = 0;
			break;
		}
		count = 0;
	}
	
	if(flag)
		printf("Yes\n");
	else
		printf("No\n");
		
	return 0;
}