#abc101b. [abc101_b]Digit Sums

[abc101_b]Digit Sums

Problem Statement

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

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

Constraints

  • 1leqNleq1091 \\leq N \\leq 10^9

Input

Input is given from Standard Input in the following format:

NN

Output

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


Sample Input 1

12

Sample Output 1

Yes

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


Sample Input 2

101

Sample Output 2

No

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


Sample Input 3

999999999

Sample Output 3

Yes