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 sc = new Scanner(System.in);

		String s = sc.next();

		while (!s.equals("")) {
			Character c = s.charAt(0);
			int count = 0;
			for (int i = 0; i < s.length(); i++) {
				if (s.charAt(i) == c.charValue()) {
					count++;
				}
			}
			if (count % 2 == 1) {
				System.out.println("No");
				sc.close();
				return;
			}
			s = s.replaceAll(c.toString(), "");
		}

		System.out.println("Yes");
		sc.close();
	}
}

