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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.*;
 
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        String s = sc.next();
        //char[] c = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
        char[] c = new char[s.length()];
        int[] n = new int[26];
        
        for(int i=0; i<s.length(); i++){
            c[i] = s.charAt(i);
        }
        
        Arrays.sort(c);
        
        
        int a=1;
        for(int i=1; i<s.length(); i++){
            if(c[i-1]==c[i]){
                a++;
            }else{
                if(a%2==1){
                    //System.out.println(c[i]);
                    System.out.println("No");
                    return;
                }
                a=1;
            }
            //System.out.print(c[i]);
            //System.out.println(a);
        }
        
        System.out.println("Yes");
   }
}