Prime Number Checker

You are given a single 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, \( n \) is prime if and only if for all integers \( i \), where \( 2 \leq i \leq \sqrt{n} \), \( i \) does not divide \( n \) evenly.

inputFormat

The input consists of a single integer ( n ). The number is provided via standard input (stdin).

outputFormat

Output a single line to standard output (stdout) containing "Prime" if ( n ) is a prime number, otherwise output "Not Prime".## sample

5

Prime