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: Wrong Answer)

#include <stdio.h>
int main(int argc, char const *argv[])
{

	char w[100],c;
	int i = 0,n[25],m = 0,k = 0;

	for (int i = 0; i <= 25; ++i)
	{
		n[i] = 0;
	}

	while(scanf("%c", &c), c!='\n') 
	{
		n[c-97]++;
		w[i++] = c; 
	}
	w[i] = '\0'; 

	for (int i = 0; i <= 25; ++i)
	{
		if (n[i]!=1 && n[i]%2!=1)
		{
			m++;
		}
		else if (n[i] == 0)
		{
			k++;
		}
		else
		{
			break;
		}
	}

	if (m+k == 26 && k != 26)
	{
		printf("Yes\n");
	}
	else
		printf("No\n");

}