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: Wrong Answer)

#include<stdio.h>
#include<iostream>
using namespace std;
int main() {
	int i = 0, t = 0, j = 0;
	char a[100], b[27] = { 0 };

	scanf("%s", a);

	//cout << "h" << endl;
	for (j = 0; j < 26; j++) {
		for (i = 0; i < 100; i++) {
			//cout << i << " " << a[j] << endl;
			if (j == a[i] - 'a')
				b[j] = b[j] + 1;
		}
	}
	for (j = 0; j < 26; j++) {
		if (b[j] % 2 == 1) {
			t++;

		}
	}
	if (t == 0) {
		printf("Yes\n");

	}
	else {
		printf("No\n");

	}
}