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