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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;

public class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    String str = in.readLine();
    String[] w = str.split("");
    int[] cnt = new int[100];
    boolean flg = true;
    for(int i=0; i<str.length(); i++) {
      cnt[(int)w[i].charAt(0)-97]++;
    }
    
    for(int i=0; i<100; i++) {
      if(cnt[i]%2!=0) {
        System.out.println("No");
        flg = false;
        break;
      }
    }
    if(flg==true)
      System.out.println("Yes");
  }
}