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 <iostream>
#include <string>

int main() {
  std::string w;
  std::cin >> w;
  int f[26] = {};
  for (auto w_i: w) ++f[w_i-'a'];
  for (int i = 0; i < 26; ++i)
    if (f[i] % 2 > 0) return puts("No"), 0;
  puts("Yes");
}