Harshad Number Checker

In this problem, you are given a single integer n and you need to determine whether it is a Harshad number.

A Harshad number is an integer that is divisible by the sum of its digits. More formally, let the sum of the digits of n be \(S(n)\). Then n is a Harshad number if

\( n \mod S(n) = 0 \).

Your task is to read the integer from the standard input and print True if it is a Harshad number, or False otherwise.

inputFormat

The input consists of a single integer n (1 ≤ n ≤ 10⁹) provided on a single line via standard input.

outputFormat

Output a single line containing either True if n is a Harshad number, or False otherwise. The output should be written to standard output.

18

True