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.*;


public class Main {
	
	Scanner cin = new Scanner(System.in);
	
	public static void main(String[] args) {
		new Main().run(); 
	}
	
	public void run() {		
		
		/*input*/
		String str = cin.nextLine();
		
		/*start*/
		
		int[] count = new int[26];
		
		for (int i = 0; i < str.length(); i ++) {
			
			count[str.charAt(i) - 'a'] ++;
		}
		
		String res = "Yes";
		
		for (int c: count) {
			
			if (c % 2 != 0) {
				res = "No";
				break;
			}
		}
		
		/*finish*/
		System.out.println(res);
	}
}

