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 ABC044B
    implicit none
    integer(8)::i,flg
    character(100)::w
    integer(8),dimension(26)::C
    read(5,*)w
    flg=0
    C=0
    do i=1,len_trim(w)
        C(ichar(w(i:i))-96)=C(ichar(w(i:i))-96)+1
    end do

    do i=1,26
        if(mod(C(i),2)==1)then
            flg=1
            exit
        end if
    end do

    if(flg==0)print'(A)',"Yes"
    if(flg==1)print'(A)',"No"
end program ABC044B