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();
		char[] c = w.toCharArray();
		char[] moji = new char[26];
		char a = 'a';
		int count = 0;

		 for (int i = 0; i < moji.length; i++){
		        moji[i] = a++;
		    }

		for (int j = 0; j < moji.length; j++) {
			for (int i = 0; i < c.length; i++) {
				if(c[i] == moji[j]) {
					count++;
				}
			}

			if(count % 2 != 0) {
				System.out.print("No");
				System.exit(0);
			}
		}

		System.out.print("Yes");
	}
}
