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);
		char[] ary = sc.next().toCharArray();
		boolean beau = true;
		for (char c1 : ary) {
			int count = 0;
			for (char c2 : ary) {
				if(c1 == c2) {
					count++;
				}
			}
			if(count%2 != 0) {
				beau = false;
				break;
			}
		}
		if(beau) System.out.println("Yes");
		else System.out.println("No");
	}
}