Contest Duration: - (local time) (100 minutes) Back to Home
B - Digit Sums /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 制約

• 1 \leq N \leq 10^9

### 入力

N


### 出力

NS(N) で割り切れるなら Yes を，割り切れないなら No を出力せよ．

### 入力例 1

12


### 出力例 1

Yes


この入力では N=12 です． S(12) = 1 + 2 = 3 なので，NS(N) で割り切れます．

### 入力例 2

101


### 出力例 2

No


S(101) = 1 + 0 + 1 = 2 なので，NS(N) で割り切れません．

### 入力例 3

999999999


### 出力例 3

Yes


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