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 (GNU Fortran 9.2.1) (judge verdict: Accepted)

program beautiful
implicit none
character(len=100) :: s
integer :: i, c(26), j

read(*,*) s
c = 0
do i = 1, len_trim(s)
j = ichar(s(i:i))-ichar('a') + 1
c(j) = c(j) + 1
end do
do i = 1, 26
if (mod(c(i),2) == 1 ) then
write(*,'(a)') 'No'
stop
end if
end do
write(*,'(a)') 'Yes'
stop
end program beautiful