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.*;
import static java.lang.System.*;
import static java.lang.Math.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(in);
String w=sc.next();
int[] a=new int[26];
    for (int i = 0; i < w.length(); i++) {
        int k=0;
        for (char j = 'a'; j <='z'; j++) {
         if(w.charAt(i)==j)a[k]++;
         k++;
        }
    }
    for (int i = 0; i < 26; i++) {
        if(a[i]%2==1){
            out.println("No");
            break;
        }
        if(i==25&&a[i]%2==0)out.println("Yes");
    }
}}