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

    import java.util.Scanner;
    class Main {
    public static void main(String... args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();
        if(n.length() % 2 == 1){
        System.out.println("no");
        System.exit(0);
        }else{
            boolean b = true;
            String s = "abcdefghijklmnopqrstuvwxyz";
            for(int i =0;i<26;i++){
                int count = 0;
                String compStr = String.valueOf(s.charAt(i));
                for(int j=0;j<n.length();j++){
                    String target = String.valueOf(n.charAt(j));
                    if(target.equals(compStr)){ count++; }
                }
                if(count %2 == 1){b=false;}
            }
            if(b){System.out.println("Yes");}
            }
        }
    }