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.lang.Math;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String w = sc.next();
    int istack;
    int alps[] = new int[26];
    boolean ans=true;
    
    Arrays.fill(alps,0);
    
    for(int i = 0;i < w.length();i++){
    	istack = (int)w.charAt(i) - 97;
      	alps[istack]++;
    }
    
    for(int i = 0;i < 26 && ans; i++){
    	if(alps[i] % 2 != 0) ans = false;
    }
    
    if(ans) System.out.println("Yes");
   	else System.out.println("No");
  }
}
