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.*;

class Main {

	public static void main(String args[]){

		Scanner scan = new Scanner(System.in);
		String s = scan.next();

		HashSet<Character> hash = new HashSet<Character>();
		char c;
		Boolean flag = true;
		if(s.length() % 2 != 0)
			flag = false;
		else{
			for(int i = 0; i < s.length(); i++){
				c = s.charAt(i);
				if(!hash.contains(c))hash.add(c);
				else hash.remove(c);
			}
		}
		if(!flag)System.out.print("No");
		else if(hash.size()==0)System.out.print("Yes");
		else System.out.print("No");
	}

}
