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()
{
    map<char,int>m;
    map<char,int>::iterator itr;
    string s;
    cin>>s;
    int i,n=s.length(),chk=0;

    if(n%2!=0) cout<<"No";
    else{
    for(i=0;i<n;i++){
        m[s[i]]++;
    }
    for(itr=m.begin();itr!=m.end();itr++){
        if(itr->second%2!=0){
                chk=1;
            break;
        }}
   if(chk==0){
        cout<<"Yes";
    }
    else cout<<"No";}
    return 0;
}