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 Java7 (OpenJDK 1.7.0) (judge verdict: Accepted)


import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String w = sc.nextLine();
        Map<String , Integer> m = new HashMap<String, Integer>();

        for (int i = 0 ; i < w.length() ; i++) {
            String s = w.substring(i, i + 1);
            if (m.containsKey(s)) {
                m.put(s, m.get(s) + 1);
            } else {
                m.put(s, 1);
            }
        }
        Iterator<Integer> i = m.values().iterator();
        while (i.hasNext()) {
            Integer a = i.next();
            if (a % 2 == 1) {
                System.out.println("No");
                return;
            }
        }


        System.out.println("Yes");
    }

}