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.Scanner;

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

        while (sc.hasNext()) {
            char[] s = sc.next().toCharArray();
            int cnt[] = new int[128];
            for (char ch : s) {
                cnt[ch]++;
            }
            boolean yes = true;
            for (int i = (int) 'a'; i <= (int) 'z'; i++) {
                if (cnt[i] % 2 != 0) {
                    yes = false;
                    break;
                }
            }
            System.out.println(yes ? "Yes" : "No");
        }
    }
}
