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 Common Lisp (SBCL 1.1.14) (judge verdict: Accepted)

(defun parse-int-ex (n)
  (cond ((stringp n) (parse-integer n))
        ((char= n #\1) 1)
        ((char= n #\2) 2)
        ((char= n #\3) 3)
        ((char= n #\4) 4)
        ((char= n #\5) 5)
        ((char= n #\6) 6)
        ((char= n #\7) 7)
        ((char= n #\8) 8)
        ((char= n #\9) 9)
        ((char= n #\0) 0)))
(defun f (k)
  (reduce #'+ (mapcar #'parse-int-ex (concatenate 'list (format nil "~A" k)))))
(let* ((n (read)))
  (if (= 0 (mod n (f n))) (princ "Yes") (princ "No")))