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 scanner = new Scanner(System.in);
		String w = scanner.next();
		boolean c = true;
		for(int i=0;i<w.length();i++){
			if(check(w,w.charAt(i))){
				c = true;
			}else{
				c = false;
				break;
			}
		}
		if(c){
			System.out.println("Yes");
		}else{
			System.out.println("No");
		}
	}
	public static boolean check(String s,char c){
		int count = 0;
		for(int i=0;i<s.length();i++){
			if(s.charAt(i) == c){
				count++;
			}
		}
		if(count%2 == 0){
			return true;
		}else{
			return false;
		}
	}
}
