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);
    String w = sc.next();
    String str[] = w.split("");

    Arrays.sort(str);

    boolean ans = true;
    int count = 1;
    for(int i = 0 ; i < w.length()-1 ; ++i){
      if(str[i].equals(str[i+1])){
        count++;
      }else if(count%2==1){
        ans = false;
        break;
      }else{
        count = 1;
      }

    }

    if(count%2==1) ans = false;
    if(ans) System.out.println("Yes");
    else System.out.println("No");
 
  }
}