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){
		Scanner sc = new Scanner(System.in);
		// 整数の入力
        char a[] = sc.next().toCharArray();
        int end[] = new int[28];
        for(int i = 0; i< 28;i++){
          end[i] = 0;
        }
        for(int i = 0; i < a.length;i++){
          end[a[i] - 97] = end[a[i] - 97] + 1;
        }
        for(int i = 0; i< 28;i++){
          if(end[i] % 2 == 1){
            System.out.println("No");
            System.exit(0);
          }
        }
        System.out.println("Yes");
    }
}