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

public class Main {

    private static Scanner scan = new Scanner(System.in);

    public static void main(String[] args) {
	String s = scan.next();
	int[] count = new int[26];
	for (int i = 0; i < s.length(); i++) {
	    count[s.charAt(i) - 'a']++;
	}

	boolean isEven = true;
	for (int i = 0; i < 26; i++) {
	    if(count[i] % 2 != 0) {
		isEven = false;
		break;
	    }
	}

	System.out.println(isEven ? "Yes" : "No");
	scan.close();
    }
}
