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 NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String N = br.readLine();
		
		String[] str = N.split("");
		
		for(int i=0; i<str.length; i++){
			if(strCnt(str, str[i])%2 != 0){
				System.out.println("No");
				return;
			}
		}
		System.out.println("Yes");
	}
	
	static int strCnt(String[] str, String x){
		int cnt=0;
		for(int i=0; i<str.length; i++){
			if(str[i].equals(x)){
				cnt++;
			}
		}
		return cnt;
	}
}