#include <bits/stdc++.h>
using namespace std;
const int N = 100002;
const int oo = 1000000007;
const double pi = acos(-1);
int n, cnt, a[N];
string s;
int prime[11] = {0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0};
int pr[25] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29, 31, 37, 41,
              43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
int main() {
  for (int i = (2); i <= (10); ++i)
    if (prime[i]) {
      printf("%d\n", i);
      fflush(stdout);
      getline(cin, s);
      a[i] = s == "yes";
      cnt += a[i];
      if (cnt > 1) {
        puts("composite");
        fflush(stdout);
        return 0;
      }
    }
  if (cnt == 0) {
    puts("prime");
    fflush(stdout);
    return 0;
  }
  for (int i = (2); i <= (10); ++i)
    if (prime[i] && a[i] == 1) {
      for (int j = (0); j <= (24); ++j)
        if (i * pr[j] > 100)
          break;
        else {
          printf("%d\n", i * pr[j]);
          fflush(stdout);
          getline(cin, s);
          if (s == "yes") {
            puts("composite");
            fflush(stdout);
            return 0;
          }
        }
    }
  puts("prime");
  fflush(stdout);
  return 0;
}
