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>

char w[101];
int c[26];
int ans = 1;

int main(void)
{
	int i, j;

	scanf("%s", w);
	for (i = 0; w[i]; ++i)
	{
		++c[w[i] - 'a'];
	}
	for (i = 0; i < 26; ++i)
	{
		if (c[i] & 1) ans = 0;
	}

	printf("%s\n", ans ? "Yes" : "No");

	return 0;
}