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{

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		String s = sc.next();

		int[] w = new int[26];

		boolean flag = false;

		for(int i=0;i<s.length();i++) {

			w[s.charAt(i)-97] ++;

		}

		for(int i=0;i<26;i++) {

			if(w[i]!=0 && w[i]%2!=0) {

				flag = true;

				break;
			}
		}

		if(flag) System.out.println("No");

		else System.out.println("Yes");
	}

}
