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

public class Main {

	public static void main(String[] args) throws IOException {
		Scanner scanner = new Scanner(System.in);
		String string = scanner.next();
		boolean flag = true;
		for(int i = 0; i < string.length(); i++){
			char c = string.charAt(i);
			int count=0;
			for(char x: string.toCharArray()){
				if(x == c){
					count++;
				}
			}
			if(count % 2 == 1){
				System.out.println("No");
				flag = false;
				break;
			}
		}
		if(flag){
			System.out.println("Yes");
		}
	}
}