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;

class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String w = sc.next();
		int count = 0;
		boolean judge = true;
		while(judge){
			if(0 == w.length()){
				System.out.println("Yes");
				break;
			}else{
				char a = w.charAt(0);
				for (int i = 0; i < w.length(); i++) {
					if(a == w.charAt(i)){
						count++;
					}
					if(i == w.length() -1){
						if(count%2 == 0){
							w = w.replaceAll(String.valueOf(a), "");
							count = 0;
						}else{
							System.out.println("No");
							judge = false;
							break;
						}
					}
				}
			}
		}
		sc.close();
	}
}
