// check if a number n is prime or composite
#include <iostream>
#include <math.h>
using namespace std;

const int n=137891; 

int main()
{
  bool composite = false; // not proven composite yet

  // loop over all p in [2,n-1] while not proven composite
  for (int p=2; (p < n) && (!composite); ++p){ 

    if (n % p == 0) {        // divisible ?
      composite = true;      // n is composite
      cout << p << ' ' << n/p << endl;
    }
  }

  if (composite)
    cout << "composite" << endl;
  else
    cout << "prime"<< endl;
}