#include <iostream>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int number_of_divisors = 0;
    for(int i = 1; i <= n; i++) {
        if(n % i == 0) {
            number_of_divisors++;
        }
    }
    if(number_of_divisors == 2) {
        cout << "PRIME" << endl;
    }
    else {
        cout << "NOT PRIME" << endl;
    }
    return 0;
}