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 alphabets = "abcdefghijklmnopqrstuvwxyz";
    int[] count = new int[26];

    for(int i = 0 ; i < w.length(); i ++){
      count[ alphabets.indexOf( w.charAt(i) ) ] ++ ;
    }

    boolean isBeautiful = true;
    for(int j = 0 ;j < 26 ; j++){
      if( count[j] % 2 != 0 ){
        isBeautiful = false;
        break;
      }
    }
    System.out.println( isBeautiful ? "Yes" : "No" );
  }
}
