import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner scn = new Scanner(System.in);
int N = 1;
while(N<2 && N>1000000000)
{
N=scn.nextInt();
}
int divisor = 2;
boolean flag = true;
while (divisor <= N-1) {
if (N % divisor == 0) {
flag = false;
}
divisor = divisor + 1;
}
if (flag == true) {
System.out.println("Prime");
} else {
System.out.println("Not Prime");
}
}
}