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);
        PrintWriter out = new PrintWriter(System.out);

        char[] ch = sc.next().toCharArray();
        final int N = ch.length;
        int[] ar = new int['z' + 1]; // 'z' == 122
        String ans = "Yes";
        
        for (int i = 0; i < N; i++) {
            int ascii = ch[i];
            ar[ascii]++;
        }
        for (int i = 'a'; i <= 'z'; i++) { // 'a' == 97
           if (ar[i] % 2 != 0)  ans = "No";
        }
        
        out.println(ans);
        
        out.flush();
    }
}