#include <iostream> using namespace std; bool isPrime(long long n) { if (n == 2) return true; if (n % 2 == 0) return false; for (long long i = 3; i * i <= n; i += 2) { if (n % i == 0) return false; } return true; } int main() { long long m; cin >> m; if (isPrime(m)) cout << "prime" << endl; else cout << "not prime" << endl; return 0; }