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<stdlib.h>

int w[99];
int i=0,j=0,flag=0;

int main () {
    
    scanf("%s",&w);
    
   // printf("%s\n",w);

    
    for (i=0;i<100;i++){
    
        for (j=0;j<100;j++){
        
            printf("%d %d\n",i,j);
            

            if (i!=j){
            
                if(w[i] = w[j]){
                
                    flag++;
        
                }
                
            } else {
            
                //break;
                
                }
            
            }
            
            
        }
        
    printf("flag = %d\n",flag);
    
    
    if(flag % 2 == 0){
    
        printf ("Yes\n");

    
    } else {
    
        printf ("No\n");

    }
    
    
    return 0;
    
    
}