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) {
		Scanner scn = new Scanner(System.in);
		Character[] let = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
		int[] enc = new int[30];
		String caca = scn.next();
		for(int i = 0;i<caca.length();i++) {
			for(int i2 = 0;i2<let.length;i2++) {
				if(let[i2]==caca.charAt(i)) {
					enc[i2]++;
				}
			}
		}boolean f = true;
		for(int i = 0;i<30;i++) {
			if(enc[i]%2==1)f=false;
		}
		if(f)System.out.println("Yes");
		else System.out.println("No");
		scn.close();
	}
}