import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        Map<Character, Integer> cache = new HashMap<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        }

        boolean beautiful = true;
        for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        }
        System.out.println(beautiful ? "Yes" : "No");
    }
} import java.util.HashMap; HashMap java.util import java.util.Map; Map java.util import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        Map<Character, Integer> cache = new HashMap<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        }

        boolean beautiful = true;
        for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        }
        System.out.println(beautiful ? "Yes" : "No");
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        Map<Character, Integer> cache = new HashMap<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        }

        boolean beautiful = true;
        for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        }
        System.out.println(beautiful ? "Yes" : "No");
    } main {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        Map<Character, Integer> cache = new HashMap<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        }

        boolean beautiful = true;
        for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        }
        System.out.println(beautiful ? "Yes" : "No");
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) String s = sc.next(); s sc.next() sc.next sc Map<Character, Integer> cache = new HashMap<>(); cache new HashMap<>() for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        } int i = 0; int i = 0; i 0 i < s.length() i s.length() s.length s i++ i++ i {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        } {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        } char c = s.charAt(i); c s.charAt(i) s.charAt s i if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            } !cache.containsKey(c) cache.containsKey(c) cache.containsKey cache c {
                cache.put(c, 1);
            } cache.put(c, 1) cache.put cache c 1 {
                cache.put(c, cache.get(c) + 1);
            } cache.put(c, cache.get(c) + 1) cache.put cache c cache.get(c) + 1 cache.get(c) cache.get cache c 1 boolean beautiful = true; beautiful true for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        } int count cache.values() cache.values cache {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        } {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        } if (count % 2 != 0) {
                beautiful = false;
                break;
            } count % 2 != 0 count % 2 count 2 0 {
                beautiful = false;
                break;
            } beautiful = false beautiful false break; System.out.println(beautiful ? "Yes" : "No") System.out.println System.out System System.out beautiful ? "Yes" : "No" beautiful "Yes" "No" String[] args args public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        Map<Character, Integer> cache = new HashMap<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        }

        boolean beautiful = true;
        for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        }
        System.out.println(beautiful ? "Yes" : "No");
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        Map<Character, Integer> cache = new HashMap<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        }

        boolean beautiful = true;
        for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        }
        System.out.println(beautiful ? "Yes" : "No");
    }
} Main
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        Map<Character, Integer> cache = new HashMap<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (!cache.containsKey(c)) {
                cache.put(c, 1);
            }
            else {
                cache.put(c, cache.get(c) + 1);
            }
        }

        boolean beautiful = true;
        for (int count : cache.values()) {
            if (count % 2 != 0) {
                beautiful = false;
                break;
            }
        }
        System.out.println(beautiful ? "Yes" : "No");
    }
}
