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;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			int[] a=new int['z'-'a'+1];
			String str=sc.next();
			for(int i=0;i<str.length();i++) a[str.charAt(i)-'a']++;
			boolean flag=true;
			for(int i=0;i<a.length;i++) if(a[i]%2!=0) flag=false;
			if(flag) System.out.println("Yes");
			else System.out.println("No");
		}
	}
}