Prime Number Checker

You are given an integer n. Your task is to determine whether n 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. Formally, a number \( n \) is prime if \( n > 1 \) and for every integer \( a \) such that \( 2 \leq a \leq \sqrt{n} \), \( a \) does not divide \( n \).

For example, if n is 5 then the output should be True because 5 is prime; if n is 10 then the output should be False because 10 is not prime.

inputFormat

The input consists of a single integer n provided via standard input.

outputFormat

Output a single line: True if the given number is prime, and False otherwise.## sample

1

False