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>
using namespace std;
int main(){
    
    string w;
    cin >>w;
    vector<int> memo(27,0);
    for(int i = 0;i < 27;i++){
        for(int j = 0;j < w.size();j++){
            if('a'+i==w[j]) memo[i]++ ;
        }
    }
    bool checker = 1;
    for(int i = 0;i < 27;i++){
        if(memo[i] % 2 == 1) checker = 0;
    }
    if(checker) cout << "Yes" << endl;
    else cout <<"No"<< endl;
    
}