Prime Number Checker

Given an integer n, your task is to determine whether it 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. In mathematical terms, a number n is prime if \(n > 1\) and \(\forall d \in \mathbb{N},\ (d\mid n \rightarrow (d=1 \lor d=n))\).

inputFormat

The input consists of a single integer n provided via standard input (stdin). The integer can be negative, zero, or positive.

outputFormat

Print 'True' if n is a prime number, or 'False' otherwise. The output should be printed to standard output (stdout) exactly as specified.## sample

2

True