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.

Examples

Input

abaccaba


Output

Yes


Input

hthth


Output

No
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String txt = scan.nextLine();

        HashMap<Character, Boolean> hash = new HashMap<Character, Boolean>();

        for (int i=0; i < txt.length(); i++) {
            if (hash.containsKey(txt.charAt(i))) {
                hash.remove(txt.charAt(i));
            } else {
                hash.put(txt.charAt(i), true);
            }
        }

        if (hash.size() == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}
