import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String w = sc.next();
		Map<Character,Integer> alphabet = new TreeMap<Character,Integer>();
		for(char x = 'a'; x <= 'z'; x++) {
			alphabet.put(x,0);
		}
		for(int i = 0; i < w.length(); i++) {
			char temp = w.charAt(i);
			int num = alphabet.get(temp)+1;
			alphabet.put(temp,num);
		}
		for(char i:alphabet.keySet()){
			if(alphabet.get(i)%2!=0) {
				System.out.println("No");
				return;
			}
		}
		System.out.println("Yes");
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz