Prime Number Checker

Given a single integer n, determine whether it is a prime number. A number is considered prime if it is greater than 1 and has no positive divisors other than 1 and itself. In mathematical terms, a number n is prime if

$$ n > 1 \quad \text{and} \quad \forall p \in \mathbb{Z}, \; 2 \leq p \leq \sqrt{n} \Rightarrow p \nmid n. $$

Your program should read the input from the standard input (stdin) and output the result as True if the number is prime or False otherwise, to the standard output (stdout).

inputFormat

The input is provided via standard input. It consists of a single line containing one integer n.

outputFormat

The output should be written to standard output. Print a single line with the result: "True" if the input integer is a prime number, otherwise "False".## sample

2

True