#include <bits/stdc++.h>
const int inf = int(1e9);
const int mod = inf + 7;
const double PI = acos(-1.0);
using namespace std;
const int N = 1e5 + 155;
const long double eps = 1e-10L;
bool isPrime(int a) {
  for (int i = 2; i * i <= a; ++i)
    if (a % i == 0) return false;
  return true;
}
bool divisible(int a) {
  printf("%d\n", a);
  fflush(stdout);
  char sl[10];
  scanf("%s", sl);
  return sl[0] == 'y' || sl[0] == 'Y';
}
int HIGH = 100;
void solve() {
  int counter = 0;
  for (int a = 2; a <= HIGH / 2 && counter < 2; ++a)
    if (isPrime(a))
      if (divisible(a)) {
        ++counter;
        if (a * a <= HIGH && divisible(a * a)) ++counter;
      }
  puts(counter >= 2 ? "composite" : "prime");
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
