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
def main():
  s = raw_input()
  memo = {}
  for c in s:
    if c not in memo:
      memo[c] = 0
    memo[c] += 1
  
  result = True
  for x in memo.values():
    if x % 2 > 0:
      result = False
      break
  print("Yes" if result else "No")

main()