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: Runtime Error)

#include<stdio.h>
#include<string.h>
char ww[101];
int cou[25];
int main()
{
	int i;
	//int ren;
	
	scanf("%s",&ww);
	for(i=0;i<= (strlen(ww)) ;i++)cou[ww[i]-96]++;
	
	/*for(i=0;i<=26;i++){
		printf("i[%d]=%d\n",i,cou[i]);
	}
	scanf("%d",&ren);*/
	for(i=0;i<=26;i++){
		if((cou[i]%2)==1){
			puts("No");
			return 0;
		}
	}
	puts("Yes");
	return 0;
}