Prime Number Checker

Given an integer \(N\), determine whether \(N\) is a prime number. A prime number is a positive integer greater than 1 that has no divisors other than 1 and itself. In other words, \(N\) is prime if and only if it is not divisible by any integer between 2 and \(\sqrt{N}\). The function should output True if \(N\) is prime and False otherwise.

You are required to implement the prime checking logic and handle input/output using standard input and output.

inputFormat

The input is provided via standard input (stdin) as a single integer \(N\), where \(N\) can be any integer.

outputFormat

Output a single line via standard output (stdout): True if \(N\) is a prime number, or False if it is not.

2

True