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;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		String w = scan.next();
		if (w.length() % 2 == 1) {
			System.out.println("No");
			return;
		}
		int a = 'a';
		int z = 'z';
		boolean flag = true;
		for (int i = a; i <= z; i++) {
			int count = 0;
			for (int j = 0; j < w.length(); j++) {
				if (w.charAt(j) == i) {
					count++;
				}
			}
			if (count % 2 == 1) {
				flag = false;
				break;
			}
		}
		if (flag) {
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}

	}
}