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++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>
using namespace std;
int main(){
	string s;
	
	string ListOfLetter;
	
	cin >> s;
	
	if(s.size() % 2 != 0){
		cout << "No";
		return 0;
	}
	
	sort(s.begin(), s.end()); 
	
	ListOfLetter += s[0];
	
	for(int i = 1; i < s.size(); i ++){
		if(s[i-1] != s[i]){
			ListOfLetter += s[i];
		}
	}
	
	int yes[ListOfLetter.size()];
	
	for(int i = 0; i < ListOfLetter.size(); i ++){
		for(int j = 0; j < s.size(); j ++){
			if(s[j] == ListOfLetter[i]){
				yes[i] ++;
			}
		}
		if(yes[i] % 2 != 0){
			cout << "No";
			return 0;
		}
	}
	cout << "Yes";
	return 0;
}