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

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		char[] letters = scanner.next().toCharArray();
		int[] exits = new int[26];
		Arrays.fill(exits, 0);
		
		for (int i = 0; i < letters.length; i++) {
			char c = letters[i];
			exits[c-'a']++;
		}
		String ans = "Yes";
		for (int i = 0; i < exits.length; i++) {
			if (exits[i]%2 != 0) {
				ans = "No";
				break;
			}
		}
		System.out.println(ans);
		
		scanner.close();
	}
}
