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.io.IOException;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws IOException {
		try (Scanner s = new Scanner(System.in)) {
			String str = s.next();
			int array[] = new int[26];
			int len = str.length();
			for (int i = 0; i < len; i++) {
				int x = str.charAt(i) - 'a';
				array[x]++;
			}
			boolean isGood = true;
			len = array.length;
			for (int i = 0; i < len; i++) {
				if (array[i] % 2 != 0) {
					isGood = false;
					break;
				}
			}
			System.out.println(isGood ? "Yes" : "No");
		}
	}
}
