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 sc = new Scanner(System.in);
		//入力文字列
		String w = sc.next();
		final String orgChars="abcdefghijklmnopqrstuvwxyz";

		String ans;
		if(w.length() % 2 == 1){
			ans = "No";
		}else{
			int flag = 0;
			int i = 0;
			while(flag == 0 && i != 26){
				if((w.length() - w.replaceAll(orgChars.substring(i,i+1),"").length()) % 2 != 0){
					flag = 1;
				}
				i++;
			}
			if(flag == 1){
				ans = "No";
			}else{
				ans = "Yes";
			}
		}
		System.out.println(ans);
	}
}
