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 java.io.*;
class Main {
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String w = br.readLine();
        int[] c = new int[26];

        for (int i=0; i<w.length(); i++) {
            c[w.charAt(i)-'a']++;
        }
        String ans = "Yes";
        for (int i=0; i<26; i++) {
            if(c[i]%2!=0){
                ans = "No";
                break;
            }
        }

        System.out.println(ans);

    }
}