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.*;
//import java.util.stream.Collectors;

public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		String s = sc.next();
		String alp = "abcdefghijklmnopqrstuvwxyz";
		int[] a = new int[alp.length()];
		for(int i=0; i<s.length(); i++){
			for(int j=0; j<alp.length(); j++){
				if(s.charAt(i) == alp.charAt(j)){
					a[j]++;
				}
			}
		}
		String result = "Yes";
		for(int i : a){
			if(i % 2 != 0){
				result = "No";
			}
		}
		System.out.println(result);
	}
}
