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

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    map<char,int>mp;
    
    string n;
    cin>>n;
    
    for(int i=0;i<n.size();i++)
    	mp[n[i]]++;
    
    bool flag =false;
    
    for(auto x:mp)
    {
    	if(x.second%2==0)
    		flag=true;
    	else if(x.second%2!=0)
    	{	flag=false;
    		break;}
    }
    if(flag==true)
    	cout<<"Yes";
    else
    	cout<<"No";
    
    
    
    
	return 0;
}