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 lol long long;
#define dob double;
int a[100000];
// size_t a =s.length();
int main(){
  string s;
  int b=0;
  for(int i=0;i<50;i++) a[i]=0;
  cin>>s;
  size_t size = s.length();
  for(int i=0;i<size;i++) a[s[i]]++;
  for(int i=0;i<size;i++){
    if(a[s[i]]%2!=0) b=1;
  }
  if(b!=0) cout<<"No\n";
  else cout<<"Yes\n";
  return(0);
}