Prime Number Checker

In this problem, you are required to determine whether a given integer n is a prime number. A prime number is defined as a natural number greater than 1 that has no positive divisors other than 1 and itself. Mathematically, an integer \(n > 1\) is prime if for every integer \(a\) such that \(2 \leq a \leq \sqrt{n}\), \(a\) does not divide \(n\) evenly.

Your task is to read an integer from standard input, check if it is prime, and print "True" if it is a prime number, or "False" otherwise.

inputFormat

The input consists of a single integer n provided via standard input. The integer can be any 32-bit signed number (including negative numbers).

outputFormat

Output a single line: "True" if n is a prime number, and "False" otherwise, printed to standard output.

2

True