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

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		StringBuilder sb = new StringBuilder();
		String s = sc.next();
		sb.append(s);
		
		while(true){
			int i = sb.indexOf(sb.substring(0, 1),1);
			if(i==-1){
				System.out.println("No");
				break;
			}
			sb.deleteCharAt(i);
			sb.deleteCharAt(0);
			if(sb.length()==0){
				System.out.println("Yes");
				break;
			}
		}
		
	}

}