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: Accepted)

#include <bits/stdc++.h>
#define forn(x, n) for (int x = 0; x < n; x++)
#define forr(x, n) for (int x = n; x >= 0; x--)
#define clr cin.ignore(numeric_limits<streamsize>::max(), '\n')
#define all(container) (container).begin(), (container).end()
#define rall(container) (container).rbegin(), (container).rend()
#define FILL(x, val) memset(x, val, sizeof(x))
#define pb push_back
#define eb emplace_back
#define fi first
#define se second

using namespace std;

typedef long long i64; 
typedef vector<int> vi;
typedef vector<i64> vi64;
typedef pair<int, int> pi;
typedef vector<pair<int, int>> vpi;

char str[101];

int main(void) {
	scanf("%s", str);
	int cnt[26] = {0};
	forn(i, (int)strlen(str)) cnt[str[i]-'a'] += 1;
	for (int x : cnt) {
		if (x % 2 != 0) {
			printf("No\n");
			return 0;
		}
	}
	printf("Yes\n");
	return 0;
}