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 <stdlib.h>
#include <math.h>
#include <string.h>

int main(int argc, char const *argv[]) {
  int i, moji[26], num;
  char* str;
  for(i=0; i<26; i++) moji[i]=0;
  scanf("%s", str);
  // printf("%s\n", str);
  i = 0;
  while(str[i]!='\0'){
    num = str[i] - 'a';
    moji[num]++;
    // printf("%d\n", num);
    i++;
  }
  int flag=1;
  for(i=0; i<26; i++){
    if(moji[i]%2!=0){
      flag=0;
    }
  }
  if(flag==1) printf("Yes\n");
  else printf("No\n");
  return 0;
}