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.Scanner;
import java.util.HashMap;

public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    char[] w = scanner.next().toCharArray();
    boolean[] isOdd = new boolean[26]; // {false, false, false...}
    for(char c: w) {
      int i = c - 'a';
      isOdd[i] = !isOdd[i];
    }
	
    boolean isAllEven = true;
    for(boolean b: isOdd) {
      if(b) {
        isAllEven = false;
      }
    }
    
    if(isAllEven) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }
}
