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 {
    static Scanner in = new Scanner(System.in);

    public static void main(String[] args) {
        char[] cs = in.next().toCharArray();
        int[] a = new int[26];
        
        for(int i = 0; i < cs.length; i++){
            a[cs[i] - 'a']++;
        }
        boolean f = true;
        for(int i = 0; i < a.length; i++){
            if(a[i] % 2 == 1){
                f = false;
                break;
            }
        }
        System.out.println(f ? "Yes" : "No");
    }
}
