#include <bits/stdc++.h>
using namespace std;
long long int modpow(long long int a, long long int n, long long int temp) {
  long long int res = 1, y = a;
  while (n > 0) {
    if (n & 1) res = (res * y) % temp;
    y = (y * y) % temp;
    n /= 2;
  }
  return res % temp;
}
int p[100];
int main() {
  p[2] = p[3] = p[5] = p[7] = 1;
  p[11] = p[13] = p[17] = p[19] = p[23] = p[29] = p[31] = p[37] = p[41] =
      p[43] = p[47] = 1;
  int flag = 0, pr;
  char res[5];
  for (int i = 2; i <= 10; ++i) {
    if (!p[i]) continue;
    printf("%d\n", i);
    fflush(stdout);
    scanf("%s", res);
    if (strcmp(res, "no") == 0)
      continue;
    else {
      pr = i;
      flag++;
      if (flag > 1) {
        printf("composite\n");
        fflush(stdout);
        return 0;
      }
    }
  }
  if (flag == 1) {
    printf("%d\n", pr * pr);
    fflush(stdout);
    scanf("%s", res);
    if (strcmp(res, "yes") == 0) {
      printf("composite\n");
      fflush(stdout);
      return 0;
    }
    for (int i = 11; i < 50; ++i) {
      if (!p[i]) continue;
      printf("%d\n", i);
      fflush(stdout);
      scanf("%s", res);
      if (strcmp(res, "yes") == 0) {
        printf("composite\n");
        fflush(stdout);
        return 0;
      }
    }
  }
  printf("prime\n");
  fflush(stdout);
  return 0;
}
