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 stdin =new Scanner(System.in);
		String s=stdin.next();
		int l=s.length();
		int i,j;
		int friend=0;
		boolean flag=true;
		char c[]=s.toCharArray();
		for(i=0;i<c.length;i++){
			for(j=0;j<c.length;j++)
				if(c[i]==c[j])
					friend++;

		if(friend%2!=0)
			flag=false;
		}
		if(flag)
			System.out.println("Yes");
		else if(!flag)
			System.out.println("No");
	}
}