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 scanner = new Scanner(System.in);
		String w = scanner.next();
		
		String[] W = w.split("");
		
		int i=0, j=0, cnt=0;
		for(i=0; i<W.length; i++ ){
			
			for(j=0; j<W.length; j++ ){
				if(W[i].equals(W[j])){
					cnt++;
				}
			}
			if(!((cnt%2)==0)){
				System.out.println("No");
				return;
			}
			cnt = 0;
		}
		System.out.println("Yes");
	}
}