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.Scanner;
public class Main{
    private static Scanner scanner = new Scanner(System.in);
    public static void main(String[] args) {
        String s = scanner.next();
        int charCount = 0, flag = 0;
        for(char c = 'a'; c<='z'; c++){
            for(int i=0; i<s.length(); i++){
                if(c == s.charAt(i))
                    charCount++;
            }
            if(charCount % 2 != 0){
                flag = 1;
                break;
            }
        }
        if(flag == 1)
            System.out.println("No");
        else
            System.out.println("Yes");
    }
}