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.*;

public class Main{
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	String w = sc.next();
	int app[] = new int[26];
	Arrays.fill(app,0);
	for ( int i = 0; i < w.length(); i++ ) {
	    app[w.charAt(i)-'a']++;
	}
	boolean f = true;
	for ( int i = 0; i  < 26; i++ ) {
	    if ( app[i] % 2 == 1 ) {
		f = false;
		break;
	    }
	}
	if(f) System.out.println("Yes");
	else System.out.println("No");
    }
}
