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.*;
public class Main {
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		String inp = in.next();
		boolean w = true;
		for(int i = 0; i < inp.length(); i++) {
			int count = 0;
			for (int j = 0; j < inp.length(); j++){
				if((inp.charAt(i) == inp.charAt(j)))
					count++;
			}
			if (count % 2 != 0){
				w = false;
				break;
			}
		}
		if (w == false)
			System.out.println("No");
		else
			System.out.println("Yes");
		
	}
}