#include <bits/stdc++.h>
using namespace std;
int const siz = 1e9, bound = 5e5, mod = siz + 7;
long long const cnt = 1e18;
bool isp[101];
vector<int> prime;
int main() {
  for (int i = 2; i * i <= 100; i++)
    if (!isp[i])
      for (int j = i * i; j <= 100; j += i) isp[j] = 1;
  isp[1] = 1;
  for (int(i) = 1; (i) <= (100); (i)++)
    if (!isp[i]) {
      prime.push_back(i);
    }
  int rr = 0;
  for (int(i) = 0; (i) < (prime.size()); (i)++) {
    if (prime[i] > 50) break;
    cout << prime[i];
    cout << endl;
    std::fflush(stdout);
    string rd;
    cin >> rd;
    if (rd[0] == 'y') {
      if (prime[i] * prime[i] <= 100) {
        cout << prime[i] * prime[i];
        cout << endl;
        std::fflush(stdout);
        cin >> rd;
        if (rd[0] == 'y') rr++;
      }
      rr++;
    }
    if (rr >= 2) break;
  }
  if (rr < 2)
    cout << "prime";
  else
    cout << "composite";
  return 0;
}
