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 s = new Scanner(System.in);
    String w = s.nextLine();
    boolean ans = solve(w);
    if(ans)
      System.out.println("Yes");
    else
      System.out.println("No");
  }

  public static boolean solve(String w){
    boolean ans = true;
    int even = 0;
    for(int i = 0; i < w.length() ; i++){
      for(int j = 0; j < w.length() ; j++){
        if(w.charAt(i) == w.charAt(j))
          even += 1;
      }
      if(even % 2 != 0 ){
        ans = false;
        break;
      }
    }
    return ans;
  }
}
