#include <bits/stdc++.h>
using namespace std;
bool prime[7000];
bool used[7000];
bool used2[7000], ok = true;
vector<long long> ask, ask2;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  memset(prime, true, sizeof prime);
  prime[1] = false;
  for (long long i = 2; i <= 200; i++) {
    if (prime[i]) {
      for (long long j = i + i; j <= 200; j += i) prime[j] = false;
    }
  }
  for (long long i = 2; i <= 100; i++) {
    if (!prime[i] && !used[i] && (i & 1)) {
      ask.push_back(i);
      for (long long j = i; j <= 100; j += i) used[j] = true;
    } else if (!prime[i] && !used2[i] && !(i & 1)) {
      ask2.push_back(i);
      for (long long j = i; j <= 100; j += i) used2[j] = true;
    }
  }
  string ans;
  cout << 2 << endl;
  fflush(stdout);
  cin >> ans;
  if (ans == "yes") {
    for (long long i : ask2) {
      cout << i << endl;
      fflush(stdout);
      cin >> ans;
      ok &= (ans == "no");
    }
  } else {
    for (long long i : ask) {
      cout << i << endl;
      fflush(stdout);
      cin >> ans;
      ok &= (ans == "no");
    }
  }
  if (ok)
    cout << "prime\n";
  else
    cout << "composite\n";
  fflush(stdout);
}
