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: Accepted)

program main
  implicit integer (a-z)
  sum=0

  read(*,*)n
  nmod=n

  do i=9,1,-1
     sum=sum+nmod/10**i
     nmod=mod(nmod,10**i)
  end do
  sum=sum+nmod

  if(mod(n,sum).eq.0) then
     write(*,*)"Yes"
  else
     write(*,*)"No"
  end if
  
end program main