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,j,t[26] = {0},flag = 0;
	char s[101],s1[27] = {'a','b','c','d','e','f','h','i','j','k','l','m','n','o','p','q','r','i','s','t','u','v','w','x','y','z'};
	scanf("%s",&s);
	for(i = 0;s[i] != '\0';i++)
	{
		for(j = 0;j < 26;j++)
		{
			if(s[i] == s1[j])
			{
				t[j]++;
			}
		}
	}
	for(i = 0;i < 26;i++)
	{
		if(t[i] % 2 != 0)
		{
			flag = 1;
			break;
		}
	}
	if(flag == 1)
		printf("No\n");
	else
		printf("Yes\n");
	return 0;
}