#include <bits/stdc++.h>
using namespace std;
const int np = 15;
const int ps[np] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
bool isPrime() {
  int cnt = 0;
  int p = -1;
  for (int i = 0; i < np; i++) {
    printf("%d\n", ps[i]);
    fflush(stdout);
    string s;
    cin >> s;
    if (s == "yes") {
      cnt++;
      p = ps[i];
      if (cnt > 1) {
        return false;
      }
    }
  }
  if (cnt == 0) return true;
  if (p > 10) return true;
  printf("%d\n", p * p);
  fflush(stdout);
  string s;
  cin >> s;
  return s != "yes";
}
int main() { puts(isPrime() ? "prime" : "composite"); }
