#include <bits/stdc++.h>
using namespace std;
const int MAX = 101;
int visit[MAX];
vector<int> prime;
vector<int> divisor[MAX];
void make_sieve() {
  for (int i = 2; i < MAX; i++) {
    if (!visit[i]) {
      prime.push_back(i);
      for (int j = i; j < MAX; j += i) {
        visit[j]++;
        divisor[j].push_back(i);
      }
    }
  }
}
int main() {
  prime.push_back(4);
  prime.push_back(9);
  prime.push_back(25);
  prime.push_back(49);
  make_sieve();
  int cont = 0;
  string ans;
  for (int i = 0; i < prime.size(); i++) {
    if (prime[i] > 49) break;
    cout << prime[i] << "\n";
    fflush(stdout);
    cin >> ans;
    if (ans == "yes") {
      cont++;
      if (cont >= 2) {
        cout << "composite\n";
        fflush(stdout);
        return 0;
      }
    }
  }
  cout << "prime\n";
  fflush(stdout);
  return 0;
}
