#include <bits/stdc++.h>
using namespace std;
int primes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
int main() {
  int num_divisors = 0;
  char buf[5];
  for (int i = 0; i < 15; i++) {
    printf("%d\n", primes[i]);
    fflush(stdout);
    scanf("%s", buf);
    if (buf[0] == 'y') {
      num_divisors++;
      if (primes[i] * primes[i] <= 100) {
        printf("%d\n", primes[i] * primes[i]);
        fflush(stdout);
        scanf("%s", buf);
        if (buf[0] == 'y') num_divisors++;
      }
    }
    if (num_divisors >= 2) break;
  }
  if (num_divisors >= 2)
    printf("composite\n");
  else
    printf("prime\n");
}
