Prime Number Checker

This problem requires you to determine whether a given integer is a prime number. A prime number is defined as an integer greater than 1 that has no positive divisors other than 1 and itself. In mathematical terms, a number \(p\) is prime if it satisfies \(p > 1\) and for any integer \(a\) with \(1 < a < p\), \(a\) does not divide \(p\) evenly. Note that the numbers 0, 1, and negative numbers are not considered prime.

inputFormat

The input consists of a single line containing an integer \(n\).

outputFormat

Output a single line: True if \(n\) is a prime number, otherwise False.

17

True