Prime Number Detection

Given an integer \( n \), determine whether it is a prime number or not. A prime number is a natural number greater than 1 that has no divisors other than 1 and itself. For example, \( 7 \) is a prime number while \( 4 \) is not because it is divisible by 2.

Your task is to implement a function that checks if the given number is prime. If the number is prime, output "True"; otherwise, output "False".

inputFormat

The input consists of a single integer \( n \) provided in the standard input (stdin).

outputFormat

The output should be a single line, either "True" if the number is a prime or "False" if it is not, printed to the standard output (stdout).

7

True