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{
	public static void main(String[]args) {
		Scanner sc = new Scanner(System.in);
		String a = sc.next();
		int nagasa = a.length();
		boolean result = true;
		//while(true) {
			for(int i = 0; i < nagasa; i++) {
				int count = 0;
				char ans = a.charAt(i);
				for(int j = 0; j < nagasa; j++) {
					if(ans == a.charAt(j)) {
						count += 1;
						}
					}
				if(count % 2 == 1) {
					result = false;
				}
			}
		if(result == true) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
}