Prime Number Checker

This problem requires you to determine whether a given integer X is a prime number.

A positive integer is considered prime if it has no positive divisors other than 1 and itself. Mathematically, a number X (with X > 1) is prime if for all integers \(i\) satisfying \(2 \leq i \leq \sqrt{X}\), \(i\) does not divide \(X\) evenly. Otherwise, the number is composite.

For example, if X = 7 then the output should be "Prime"; if X = 10 then the output should be "Not Prime".

inputFormat

The input consists of a single integer X provided via standard input (stdin). It represents the number which you need to check for primality.

outputFormat

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

7

Prime