Abundant Number Checker

This problem requires you to determine whether a given integer n is an abundant number. An abundant number is defined as a positive integer for which the sum of its proper divisors (divisors excluding the number itself) is greater than the number.

For example, consider n = 12: its proper divisors are 1, 2, 3, 4, and 6. Their sum is 16, which is greater than 12, so 12 is an abundant number.

Your task is to read an integer from the standard input and print True if the number is abundant; otherwise, print False.

Note: If the input is non-positive, consider it as not abundant.

inputFormat

The input consists of a single line containing one integer n (-10⁹ ≤ n ≤ 10⁹).

outputFormat

Output a single line: True if n is an abundant number, or False otherwise.

12

True