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.*;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		List<Integer> alf = new ArrayList<Integer>();
		for(int i=0;i<26;i++) {
			alf.add(0);
		}
		for(int i=0;i<s.length();i++) {
	//		System.out.println(s.charAt(i));
			int a = (int)s.charAt(i);
	//		System.out.println(a);
			alf.set(a-97, alf.get(a-97)+1);
		}
	//	System.out.println(alf);
		String ans = "Yes";
		for(int i=0;i<26;i++) {
			if(alf.get(i)%2!=0) {
				ans = "No";
			}
		}
		System.out.println(ans);
	}

}