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.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintStream out = new PrintStream(System.out);
        String w;
        int list[] = new int[26];

        w = sc.nextLine();
        
        for (int i = 0; i < w.length(); i++) {
            //char a=97 b=122
            list[w.charAt(i) - 97]++;
        }

        for (int i = 0; i < 26; i++) {
            if(list[i]%2 != 0) {
                out.println("No");

                sc.close();
                return;
            }
        }

        out.println("Yes");
        sc.close();
    }
}