#include <bits/stdc++.h>
using namespace std;
int number[120], prime[120], primecounter = 0;
void sieve() {
  for (int i = 0; i <= 100; i++) number[i] = 1;
  number[0] = 0;
  number[1] = 0;
  for (int i = 4; i <= 100; i = i + 2) number[i] = 0;
  for (int i = 3; i * i <= 100; i = i + 2) {
    for (int j = 2 * i; j <= 100; j = j + i) {
      if (number[j] == 1) number[j] = 0;
    }
  }
  for (int i = 2; i <= 100; i = i + 1) {
    if (number[i] == 1) {
      primecounter++;
      prime[primecounter] = i;
    }
  }
}
int main(void) {
  sieve();
  char line[50];
  int save[100 + 20];
  int yes = 0, no = 0, s;
  for (int i = 1; prime[i] <= 53; i++) {
    printf("%d\n", prime[i]);
    fflush(stdout);
    scanf("%s", line);
    if (strcmp("yes", line) == 0) {
      yes++;
      s = prime[i];
    } else
      no++;
  }
  if (yes == 0) {
    printf("prime\n");
    fflush(stdout);
    return 0;
  } else if (yes > 1) {
    printf("composite\n");
    fflush(stdout);
    return 0;
  } else if (yes == 1) {
    int v = s * s;
    if (v <= 100) {
      printf("%d\n", v);
      fflush(stdout);
      scanf("%s", line);
      if (strcmp("yes", line) == 0) {
        printf("composite\n");
        fflush(stdout);
        return 0;
      } else {
        printf("prime\n");
        fflush(stdout);
        return 0;
      }
    } else {
      printf("prime\n");
      fflush(stdout);
      return 0;
    }
  }
  return 0;
}
