Thriving Number Checker

A thriving number is a positive integer \( n \) which is divisible by the sum of its digits. Let the sum of the digits of \( n \) be defined as

$$S(n) = \sum_{i=1}^{k} d_i,$$

where \( d_i \) represents each digit of \( n \). If \( n \) is divisible by \( S(n) \) (i.e. \( n \bmod S(n) = 0 \)), then \( n \) is considered a thriving number.

Your task is to write a program that reads an integer from the input, checks whether the number is a thriving number, and outputs "Yes" if it is, and "No" otherwise.

inputFormat

The input consists of a single integer \( n \) provided via stdin.

outputFormat

Output a single line to stdout containing either "Yes" if \( n \) is a thriving number, or "No" if it is not.

## sample

18

Yes

</p>