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);
		String[] w  = sc.next().split("");
		if(w.length %2 !=0) {
			System.out.println("No");
			return;
		}
		Arrays.sort(w);
		int count = 1;
		String compare = w[0];
		for(int i =1;i <w.length;i++) {
			if(!compare.equals(w[i])) {
				if(count %2 !=0) {
					System.out.println("No");
					return;
				}
				compare = w[i];
				count =1;
			}else {
				count++;
			}
			if(i == w.length-1) {
				if(count %2 !=0) {
					System.out.println("No");
					return;
				}
			}
		}
		System.out.println("Yes");
	}
}