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.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String w = sc.next();

        System.out.println(solve(w) ? "Yes" : "No");

        sc.close();
    }

    static boolean solve(String w) {
        int[] counts = new int[26];
        w.chars().forEach(ch -> ++counts[ch - 'a']);

        return Arrays.stream(counts).allMatch(count -> count % 2 == 0);
    }
}