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

class Main {
	public static void main(String[] args) {
		Main m = new Main();
		m.ABC044_B();
	}
	void ABC044_B() {
		Scanner in = new Scanner(System.in);
		String str = in.next();
		int[] count = new int[26];
		for (int i=0; i < str.length(); ++i) {
			count[str.charAt(i)-'a']++;
		}
		for(int i=0; i<count.length; ++i){
			if(count[i]%2!=0){
				System.out.println("No");
				return;
			}
		}
		System.out.println("Yes");
	}
}