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

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		String w = sc.next();
		int count = 1;
		int i = 0;
		while (w.length() >= 2) {
			for (int j = i + 1; j < w.length(); j++) {
				if (w.substring(i, 1).equals(w.substring(j, j + 1))) {
					count++;
				}
			}
			if (count % 2 == 1) {
				System.out.println("No");
				break;
			}
			count = 1;
			w = w.replaceAll(w.substring(0, 1), "");
		}
		if (w.length() == 0) {
			System.out.println("Yes");
		} else if (w.length() == 1) {
			System.out.println("No");
		}
	}
}