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