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 9.2.1) (judge verdict: Accepted)

#include<stdio.h>
#include<string.h>

#define MOJI_LEN 101
#define ALPHA 26

int main(void){
	int i;
	int len;
	char moji[MOJI_LEN+1];
	char alp[ALPHA+1]={0};
	scanf("%s",moji);

	len=strlen(moji);
	for(i=0;i<len;i++){
		alp[moji[i]-'a']++;
	}
	for(i=0;i<ALPHA;i++){
		if(alp[i]%2!=0){
			printf("No\n");
			break;
		}if( (i>=ALPHA-1) && (alp[i]%2==0) ){
			printf("Yes\n");
			break;
		}
	}

	return 0;
}