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 <cstdio>
#include <map>

int main()
{
  char s[101];
  scanf("%s", s);
  std::map<char, int> m;
  for (char* p = s; *p; ++p)
  {
    m[*p]++;
  }
  for (auto &p : m)
  {
    if (p.second & 1)
    {
      puts("No");
      return 0;
    }
  }
  puts("Yes");
  return 0;
}