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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String w = sc.next();
		Map<Character,Integer> alphabet = new TreeMap<Character,Integer>();
		for(char x = 'a'; x <= 'z'; x++) {
			alphabet.put(x,0);
		}
		for(int i = 0; i < w.length(); i++) {
			char temp = w.charAt(i);
			int num = alphabet.get(temp)+1;
			alphabet.put(temp,num);
		}
		for(char i:alphabet.keySet()){
			if(alphabet.get(i)%2!=0) {
				System.out.println("No");
				return;
			}
		}
		System.out.println("Yes");
	}
}
