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);

		String w=sc.nextLine();
		int len=w.length();

		char c[]=new char[len];
		for(int i=0;i<len;i++){
			c[i]=w.charAt(i);
		}

		int jud=0,flg=0;
		for(int i=0;i<len;i++){
			for(int j=0;j<len;j++){
				if(c[i]==c[j])	jud++;
			}
			if(jud%2==1)	flg=1;
		}

		if(flg==0)	System.out.println("Yes");
		else	System.out.println("No");
	}
}