#include <bits/stdc++.h>
using namespace std;
const vector<int> primes = {2,  3,  5,  7,  11, 13, 17, 19,
                            23, 29, 31, 37, 41, 43, 47};
char s[10];
inline int Ask(int x) {
  printf("%d\n", x);
  fflush(stdout);
  scanf("%s", s);
  return s[0] == 'y';
}
int main() {
  const vector<int> sp = {4, 9, 25, 49};
  for (int i = 0; i < 4; i++) {
    if (Ask(sp[i])) {
      puts("composite");
      fflush(stdout);
      return 0;
    }
  }
  int divisible = 0;
  for (int i = 0; i < 15; i++) {
    divisible += Ask(primes[i]);
    if (divisible > 1) break;
  }
  puts(divisible > 1 ? "composite" : "prime");
  fflush(stdout);
  return 0;
}
