#C713. Stark Number Checker

    ID: 50967 Type: Default 1000ms 256MiB

Stark Number Checker

Stark Number Checker

In this problem, you are given a single integer n. Your task is to determine whether n is a Stark Number. A number is defined as a Stark Number if it is divisible by the sum of its digits. In mathematical terms, let \( S(n) \) denote the sum of the digits of \( n \). Then, \( n \) is a Stark Number if and only if

\[ n \mod S(n) = 0 \]

For example, for \( n = 18 \), the sum of its digits is \( 1 + 8 = 9 \) and since \( 18 \) is divisible by \( 9 \), 18 is a Stark Number.

inputFormat

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

outputFormat

Output one line: print Stark Number if \( n \) is divisible by the sum of its digits; otherwise, print Non-Stark Number.

## sample
18
Stark Number