#include <bits/stdc++.h>
using namespace std;
#define M 1000000
bool marked[M];
bool isPrime(int n)
{
    if (n < 2) return false;
    if (n == 2) return true;
    if (n % 2 == 0) return false;
    return marked[n] == false;
}
void sieve(int n)
{
    for (int i = 3; i * i <= n; i += 2)
    {
        if (marked[i] == false)
        {
            // i is a prime
            for (int j = i * i; j <= n; j += 2*i)
            {
                marked[j] = true;
            }
        }
    }
}
int main()
{
    int a,b,c;
    cin>>a;
    if(isPrime(a)== true ) cout<<"Prime\n";
    else cout<<"Not Prime\n";
    return 0;
}