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.io.BufferedInputStream;
import java.util.*;

public class Main {


    public static void main(String[] args) {

        Scanner s = new Scanner(new BufferedInputStream(System.in));
        String str = s.nextLine();
        int[] n = new int[26];
        for (int i = 0;i < str.length(); i++) {
            n[str.charAt(i) - 'a']++;
        }
        for (int i: n) {
            if ((i & 1 )== 1) {
                System.out.println("No");
                return;
            }
        }
        System.out.println("Yes");
    }
}