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[] s = sc.next().split("");
      HashMap<String,Integer> map = new HashMap<>();
      
      for(String t:s){
        int number = map.getOrDefault(t,0);
        map.put(t,number+1);
      }
      
      System.out.println(check(map)?"Yes":"No");
      
     
      
      
      
    }
  private static boolean check(HashMap<String,Integer> mp){
    for(Integer b:mp.values()){
      if(b % 2 != 0) return false;
    }
    return true;
  }
  
}