Prime Number Checker

Given an integer n, determine whether it 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. Your task is to print Prime if the number is prime, otherwise print Not Prime. For reference, a number n is prime if there is no integer k (with \(2 \le k \le \sqrt{n}\)) that divides n evenly.

The solution should handle various cases including negative numbers, zero, and one, which are not considered prime.

inputFormat

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

Constraints: n is a 32-bit signed integer.

outputFormat

Output a single line: Prime if n is a prime number, otherwise Not Prime.

7

Prime