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;
import java.util.function.Function;
import java.util.stream.Collectors;

public class Main {

	private static final int MOD = 1000000007;

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		String w = sc.next();

		boolean beautiful = w.chars().boxed()
				.collect(Collectors.groupingBy(Function.identity(), Collectors.counting()))
				.values().stream()
				.allMatch(v -> v % 2 == 0);

		System.out.println(beautiful ? "Yes" : "No");
	}
}
