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 {

	private void doit(){
		Scanner sc = new Scanner(System.in);
		long mod = 1000000007;
		while(sc.hasNext()){
			char [] c = sc.next().toCharArray();
			int [] data = new int[26];
			
			for(int i = 0; i < c.length; i++){
				data[c[i] - 'a']++;
			}
			
			boolean flg = true;
			for(int i = 0;i <data.length; i++){
				if(data[i] % 2 != 0){
					flg = false;
					break;
				}
			}
			
			System.out.println(flg ? "Yes" : "No");
		}

	}

	private void debug(Object... o) {
		System.out.println("debug = " + Arrays.deepToString(o));
	}

	public static void main(String[] args) {
		new Main().doit();
	}

}
