public class PrimeorNot {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); //Test case : 32,452,843 is a prime number
sc.close();
boolean isPrime = true;
for(int i=2 ; i<=Math.sqrt(n) ; i++) {
if(n%i==0)
isPrime = false;
}
if(isPrime)
System.out.println("Prime");
else
System.out.println("Not prime");
}
}