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++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include<stdio.h>
#include<stdlib.h>
#include<math.h>

int main() {
	//declaration//
	char w[100];
	int i, k, l;
	int sum;

	//scanning//
	for (i = 1; i <= 100; i = i + 1) {
		scanf("%s", w[i]);
	}

	//checking//
	sum = 0;

	for (k = 0; k <= 98; k = k + 1) {
		for (l = 1; l <= 99; l = l + 1) {
			if (w[k] == w[l]) {
				sum = sum + 1;
			}
			else {
				sum = sum + 0;
			}
		}
	}

	if (sum % 2) {
		printf("Yes");
	}
	else {
		printf("No");
	}

	return(0);
}