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.*;
import java.io.PrintWriter;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Math.*;
import static java.lang.System.*;

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