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.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader input =new BufferedReader (new InputStreamReader (System.in));
		String str = input.readLine( );

		String before = str;
		String after = "";
		int diff = 0;

		while(before.length() > 0){
			after = before.replace(String.valueOf(before.charAt(0)), "");
			diff = before.length() - after.length();
			if(diff%2 != 0){
				System.out.println("No");
				System.exit(0);
			}
			before = after;
		}

		System.out.println("Yes");

	}

}
