Prime Number Checker

In this problem, you are given a single integer (n) as input and must determine whether (n) is a prime number. A number is considered prime if it is greater than 1 and has no divisors other than 1 and itself. Specifically, a number (n) is prime if it satisfies the following conditions:

1. (n > 1).
2. For any integer (d) with (2 \leq d \leq \sqrt{n}), (d) does not divide (n) evenly.

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

inputFormat

The input consists of a single integer (n) provided on stdin.

outputFormat

Output a single line containing either "True" if (n) is a prime number, or "False" if it is not.## sample

29

True