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;

public class Main {
  public static void main(String[] args) {
    final Scanner scanner = new Scanner(System.in);

    final String s = scanner.nextLine();
    final boolean[] alphabets = new boolean[26];
    for (char c: s.toCharArray()) {
      alphabets[c - 'a'] = !alphabets[c - 'a'];
    }

    for (boolean a: alphabets) {
      if (a) {
        System.out.println("No");
        return;
      }
    }

    System.out.println("Yes");
  }
}