#include <iostream>
#include <bitset>

using namespace std;

const int max_prime = 10000000;

bitset<max_prime> sieve;

void eratosten() {
    sieve.set();
    sieve.reset(0);
    sieve.reset(1);

    for (int i = 2; i*i < max_prime; ++i)
	if (sieve[i])
	    for (int j = i+i; j < max_prime; j += i)
		sieve.reset(j);
}

int main() {
    eratosten();

    int n;
    while (cin >> n) {
	if (!sieve[n])
	    cout << "not ";
	cout << "prime" << endl;
    }

    return 0;
}