#K48987. Perfect Number Checker

    ID: 28542 Type: Default 1000ms 256MiB

Perfect Number Checker

Perfect Number Checker

Determine whether a given positive integer n is a perfect number. A number is called perfect if it is equal to the sum of its proper divisors (divisors excluding itself). In mathematical terms, a number \(n\) is perfect if it satisfies the equation:

\[ n = \sum_{d \mid n,\ d < n} d \]

For example, 6 is perfect because \(6 = 1 + 2 + 3\), and 28 is perfect because \(28 = 1 + 2 + 4 + 7 + 14\). Conversely, numbers like 10 or 1 are not perfect.

inputFormat

The input consists of a single line containing one positive integer n.

Note: You can assume that 1 \le n \le 10^8.

outputFormat

Output a single line with True if n is a perfect number, otherwise output False.

## sample
6
True

</p>