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.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;

public final class Main {
	public static void main(String[] args) throws java.lang.Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String arg = br.readLine();
		Solver s = new Solver();
		System.out.println(s.solve(arg));
	}

}

class Solver {

	String solve(String s) {

		int in[] = new int[26];
		for (int i = 0; i < s.length(); i++) {
			in[s.charAt(i) - 'a']++;
		}
		int t = 0;
		for (int j = 0; j < in.length; j++) {
			t |= (in[j] & 1);
		}
		if (t > 0)
			return "No";
		else
			return "Yes";

	}

}
