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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String w = sc.next();
		
		Map<Character, Integer> counter = new HashMap<>();
		for (char c : w.toCharArray()) {
			int count = counter.getOrDefault(c, 0);
			counter.put(c, count + 1);
		}
		
		boolean isBeautiful = counter.values().stream().allMatch(i -> i % 2 == 0);
		String result = isBeautiful? "Yes" : "No";
		System.out.println(result);
	}

}
