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) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner scan = new Scanner(System.in);
		String w = scan.nextLine();
		char[] c = w.toCharArray();
		int[] count =new int[c.length];
		String show =null;
		for(int i=0;i<c.length;i++) {
			for (int m=0;m<c.length;m++) {
				if(c[i]==c[m]) {
					count[i]++;
				}
			}

		}
		for(int i=0;i<c.length;i++) {
			if(count[i]%2!=0) {
				show ="No";
				break;
			}else {
				show="Yes";
			}
		}
		//System.out.println(count[0]);
		System.out.println(show);

	}

}
