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