Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

abaccaba

Sample Output 1

Yes

a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.

Sample Input 2

hthth

Sample Output 2

No

Solution in Python (3.8.2) (judge verdict: Accepted)

a = input()
b = []
c = int(len(a))
import collections

for i in range(c):
  b.append(a[i])

d = collections.Counter(b)
e = []

for i in d.values():
  e.append(i)

f = int(len(e))
g = int(0)

for i in range(f):
  if int(e[i]) % 2 == 0:
    pass
  else:
    g = g + 1

if g == 0:
  print("Yes")
else:
  print("No")