Problem:
Score : 200 points

Problem Statement

Let S(n) denote the sum of the digits in the decimal notation of n.
For example, S(101) = 1 + 0 + 1 = 2.

Given an integer N, determine if S(N) divides N.

Constraints

1 \leq N \leq 10^9

Input

Input is given from Standard Input in the following format:

N

Output

If S(N) divides N, print Yes; if it does not, print No.

Sample Input 1

12

Sample Output 1

Yes

In this input, N=12.
As S(12) = 1 + 2 = 3, S(N) divides N.

Sample Input 2

101

Sample Output 2

No

As S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.

Sample Input 3

999999999

Sample Output 3

Yes

Solution in Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

program ds
    implicit none
    integer(4) n
    integer :: i=0,digit=0,tmp=0,sn=0

    read(*,*) n
    if(n<1 .or. 10**9<n)then
    else
        do i=0,9
        if(.not. n/(10**i)==0)then
            digit = digit + 1
        else
        endif
        enddo

        do i=0,digit
            tmp = n/(10**(digit-i))
            sn = sn + tmp
            n = n - tmp*10**(digit-i)
            !write(*,*) tmp,sn,n
        enddo
    
        if(modulo(n,sn)==0)then
            write(*,*) 'Yes'
        else
            write(*,*) 'No'
        endif
    endif

end program ds