#include <bits/stdc++.h>
using namespace std;
const int sv = 1000111;
int lp[sv], phi[sv];
vector<int> pr;
void phiprimelp(int n) {
  phi[1] = 1;
  for (int i = 2; i <= n; i++) {
    if (lp[i] == 0) {
      lp[i] = i;
      phi[i] = i - 1;
      pr.push_back(i);
    }
    if (lp[i] == lp[i / lp[i]])
      phi[i] = phi[i / lp[i]] * lp[i];
    else
      phi[i] = phi[i / lp[i]] * (lp[i] - 1);
    for (int j = 0; j < pr.size() && pr[j] <= lp[i] && i * pr[j] <= n; j++)
      lp[i * pr[j]] = pr[j];
  }
}
int main() {
  int t, n, m, i, j;
  phiprimelp(200);
  t = 0;
  char second[10];
  printf("2\n");
  fflush(stdout);
  scanf("%s", second);
  if (second[0] == 'y' || second[0] == 'Y') {
    t++;
    n = 2;
  }
  printf("3\n");
  fflush(stdout);
  scanf("%s", second);
  if (second[0] == 'y' || second[0] == 'Y') {
    t++;
    n = 3;
  }
  printf("5\n");
  fflush(stdout);
  scanf("%s", second);
  if (second[0] == 'y' || second[0] == 'Y') {
    t++;
    n = 5;
  }
  printf("7\n");
  fflush(stdout);
  scanf("%s", second);
  if (second[0] == 'y' || second[0] == 'Y') {
    t++;
    n = 7;
  }
  if (t == 0) {
    printf("prime\n");
  } else if (t == 1) {
    t = 0;
    for (i = 4;; i++) {
      if (pr[i] * n > 100) break;
      printf("%d\n", pr[i]);
      fflush(stdout);
      scanf("%s", second);
      if (second[0] == 'y' || second[0] == 'Y') t++;
      if (t) break;
    }
    printf("%d\n", n * n);
    fflush(stdout);
    scanf("%s", second);
    if (second[0] == 'y' || second[0] == 'Y') t++;
    if (t)
      printf("composite\n");
    else
      printf("prime\n");
  } else
    printf("composite\n");
  fflush(stdout);
  return 0;
}
