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<bits/stdc++.h>
using namespace std;

using ll = long long;
const ll amari = 1e9+7;
const char BC = 'A' - 'a';
#define ben(a) a.begin(),a.end()
#define pb(a,b) a.push_back(b)

int main(){
	string s;
	cin >> s;
	vector<char> c;
	for(int i = 0; i < s.size(); i++){
		pb(c,s[i]);
	}
	sort(ben(c));
	int ok = 0;
	int check = 0;
	for(int i = 0; i < s.size() - 1; i++){
		if(c[i] == c[i + 1]){
			ok++;
		}
		else{
			ok++;
			if(ok % 2)check = 1;
			ok = 0;
		}

		if(i == s.size() - 2){
			ok++;
			if(ok % 2)check = 1;
		}
	}
	if(check)cout << "No" << endl;
	else cout << "Yes" << endl;
	return 0; 
}