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: Wrong Answer)

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

int main(){
  string w;
  int i,j,cnt;
  char c[25];
  cin>>w;
  for(i=0;i<=w.size()-1;i++){
    cnt=0;
    for(j=0;j<=w.size()-1;j++){
      if(w.at(i)==w.at(j))cnt++;
    }
    if(cnt%2!=0){
      cout<<"NO";
      break;
    }
    if(i==w.size()-2)cout<<"YES";
  }
}