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: Runtime Error)

#include <stdio.h>
#include <string.h>
#include <stdint.h>

int main() {

  uint8_t str[100] = {}, count[26] = {};
  scanf("%s", str);
  uint32_t len = strlen((char *)str);

  for(uint32_t i=0;i<len;i++)
    count[str[i] - 'a']++;

  for(uint32_t i=0;i<26;i++) {
    if(count[i] % 2) {
      puts("No");
      return 1;
    }
  }

  puts("Yes");
  
  return 0;
}