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>
char w[100];int len;int n[33];
int main()
{
	scanf("%s",w);
	len=strlen(w);
	int value;
	for(int i=0;i<len;i++)
	{
		value=w[i]-'a';
		if(value>=0)n[value]++;
	}
	int ans=1;
	for(int i=0;i<26;i++)
	{
		if(n[i]%2==1)ans=0;
	}
	if(ans==1)printf("Yes");
	else printf("No");
}