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.Arrays;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		Arrays.sort(s);
		int num = 1;
		boolean c = true;
		for(int i = 0; i < s.length-1; i++) {
			if(s[i] == s[i+1]) {
				num++;
			}else {
				if(num % 2 != 0) {
					c = false;
					break;
				}
				num = 1;
			}
		}
		if(num % 2 != 0) c = false;
		if(c)System.out.println("Yes");
		else System.out.println("No");
	}
}
