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;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
  string W;
  cin>>W;
  map<char,int> mp;
  for(char x='a';x<='z';x++){
    mp[x]=0;
    rep(i,W.size()){
     if(W[i]==x) mp[x]++;
    }
  }
  for(char x='a';x<='z';x++){
    if(mp[x] %2 != 0) {
      puts("No");  
      return 0;
    }
  }
  puts("Yes");
  return 0;
}