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 Fortran (gfortran v4.8.4) (judge verdict: Accepted)

program main
implicit none
integer :: i, j, k, l, a(26)
character :: s*100

read(*,*) s
l = len(s)
a = 0
do i = 1, l
   do j = 1, 26
      k = ichar(s(i:i)) -96
      if( j == k ) then
         a(j) = a(j) + 1
      end if
   end do
end do
do j = 1, 26
   if( mod(a(j),2) /= 0 ) then
      write(*,*) 'No'
      stop
   end if
end do
write(*,*) 'Yes'

end program main