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 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
 
int main(void){
 
  char sa[101];
  char sb[101];
  char sc[101];
  scanf("%s", sa);
  scanf("%s", sb);
  scanf("%s", sc);
  int a_length = strlen(sa);
  int b_length = strlen(sb);
  int c_length = strlen(sc);
  int a = a_length;
  int b = b_length;
  int c = c_length;
  int player = 0;
  while (1) {
    if (player == 0) {
      if (a == 0) {
        printf("A\n");
        break;
      }
      player = sa[a_length-a] - 'a';
      a--;
    } else if (player == 1) {
      if (b == 0) {
        printf("B\n");
        break;
      }
      player = sb[b_length-b] - 'a';
      b--;
    } else {
      if (c == 0) {
        printf("C\n");
        break;
      }
      player = sc[c_length-c] - 'a';
      c--;
    }
  }
 
  return 0;
}