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.*;

public class Main {
    public static void main(String[] args) throws Exception {

        Scanner sc = new Scanner(System.in);
        String w = sc.next();
        //英字をカウントするための配列を準備
        int[] alphabet = new int[26];

        for(int i = 0; i < w.length(); i++){
            //char型(実体は整数値)を用いて、英字をカウント
            alphabet[w.charAt(i) - 'a']++;
        }
        
        //配列の要素がすべて偶数であるかチェック
        boolean beauty = true;
        for(int i = 0; i < 26; i++){
            if(alphabet[i] % 2 != 0)beauty = false;
        }
        
        //三項演算子で評価
        System.out.println(beauty? "Yes" : "No");
    }
}
