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.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

	void run() {
		Scanner sc = new Scanner(System.in);

		char[] c = sc.next().toCharArray();

		Map<Character, Integer> count = new HashMap<>();

		for (char key : c) {
			if (!count.containsKey(key)) {
				count.put(key, 1);
			} else {
				int value = count.get(key);
				count.put(key, value + 1);
			}
		}

		for (char key : count.keySet()) {
			int value = count.get(key);
			if (value % 2 != 0) {
				System.out.println("No");
				return;
			}
		}

		System.out.println("Yes");

	}

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

}
