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. In mathematical terms, an integer ( n ) is prime if and only if ( n > 1 ) and for every integer ( d ) such that ( 1 < d < n ), ( d ) does not divide ( n ) evenly.

inputFormat

The input consists of a single line containing one integer ( n ).

outputFormat

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

2

True