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

#include<stdio.h>
using namespace std;

int main(void)
{
	char S[100];
	int p=0;
	scanf("%s", S);
	int count[26] = { 0 };
	int i = 0;
	while (S[i] !='\0') {
		count[S[i] - 'a']++;
		if (count[S[i] - 'a'] % 2 == 1) {
			p += 1;
		}
		else
			p -= 1;
		i++;
	}
	if (p == 0) {
		printf("Yes");
	}
	else
		printf("No");
	
	return 0;
}