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 rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
int cnt[26];

int main()
{
	memset(cnt, 0, sizeof(cnt));
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	string w; cin >> w;

	rep (i, w.length()){
		++cnt[(int)(w[i] - 'a')];
	} // end rep

	bool ok = true;
	rep (i, 26){
		if (cnt[i] % 2 != 0) ok = false;
	} // end rep
	
	cout << (ok ? "Yes" : "No") << endl;

	return 0;
}