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

class Main{



	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);			//文字の入力
		String string = sc.next();
		char[] cs = string.toCharArray();
		Arrays.sort(cs);
		int count = 1;
		for(int i = 0;i < string.length()-1;i++){
			if(cs[i] == cs[i+1]){
				count++;
			}else{
				if(count%2 != 0){
					System.out.println("No");
					return;
				}
				count = 1;
			}
		}
		if(count%2 != 0){
			System.out.println("No");
			return;
		}else{
			System.out.println("Yes");
		}

	}
}