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 Julia (0.5.0) (judge verdict: Runtime Error)

function main()
  
  w = split(readline(),"")
  
  a2z = [string(i) for i in 'a':'z']
  
  count = 0
  
  for i in a2z
    for j in 1:length(S)
      
      if S[j] == i
        count += 1
      end
      
    end
    
    if count % 2 == 0
      count = 0
    else
      break
    end
    
  end
  
  if count == 0
    println("Yes")
  else
    println("No")
  end
  
end

main()