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
#include <stdio.h>
int main(void){
  int a[123]={},i;
  char s[101];
  scanf("%s",s);
  for (i=0;s[i];i++) a[(int)s[i]]++;
  for (i=97;i<123;i++){
    if (a[i]%2){
      printf("No\n");
      return 0;
    }
  }
  printf("Yes\n");
  return 0;
}