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 sc = new Scanner(System.in);
        boolean bl = true;
        char[] array = sc.next().toCharArray();
        Arrays.sort(array);
        for (int i=0;i<array.length;i++) {
            char c = array[i];
            int j = i+1;
            int count = 1;
            while (j < array.length && c == array[j]) {
                count++;
                i = j;
                j++;
            }
            if (count%2==1) {
                bl = false;
                break;
            }
        }
        System.out.println(bl?"Yes":"No");

    }
}