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 {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String s = sc.nextLine();
		char[] c_array = s.toCharArray();
		Map<Character, Integer> counter = new HashMap<Character, Integer>();
		for (char c : c_array) {
			counter.put(c, counter.get(c) == null?1:counter.get(c) + 1);
		}
		int flag = 0;
		for (char key : counter.keySet()) {
			if (counter.get(key) % 2 != 0) {
				flag = 1;
			}
		}
		if (flag == 1) {
			System.out.println("No");
		}
		else 
			System.out.println("Yes");
	}
}