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 (Clang 3.8.0) (judge verdict: Accepted)

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

int main(void){

  char str[101] ="\0";
  scanf("%s",str);
  int len = strlen(str);
	int moji[26];
  int j = 0;/*アルファベットに対応する数字*/
  int Flag = 0; /*w判定フラグ*/

  for(int i=0; i<27;i++){
    moji[i] = 0;
  }
  
  for(int i=0; i<len; i++){
    for(char m = 'a'; m <= 'z'; m++){
      
      if( m == 'a'){　/*文字と番号を同期*/
        j = 0;
      }else{
        /*何もしない*/
      }

      if( str[i] == m ){
          moji[j] ++;
      }else{
        /*何もしない*/
      }
      j++;
    }    
  }

  for( j=0; j<27; j++){
    if( (moji[j] %2) == 0 ){
      /*何もしない*/
    }else{
      Flag = 1;
    }
  }

  if(Flag ==0 ){
    printf("Yes");
  }else{
    printf("No");
  }


  return 0;
}