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();
  char[] alp = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
  boolean b = true;
  for(int i = 0;i < 26;i++){
    int counter = 0;
    for(int j = 0;j < w.length();j++){
      if(w.charAt(j) == alp[i]){
        counter++;
      }
    }
    if(counter%2 == 1){
      b = false;
      System.out.println("No");
      break;
    }
  }
    if(b)System.out.println("Yes");
}}