#include <bits/stdc++.h>
using namespace std;
int primes[] = {2, 3, 5, 7};
int pot[] = {2, 4, 8, 16, 32, 64, 3, 9, 27, 81, 5, 25, 7, 49};
int isDiv[101];
void sieve() {
  int cnt = 0;
  int ans = 0;
  for (int i = 2; i < 101; i++) {
    if (isDiv[i]) continue;
    cnt++;
    cout << i << endl;
    string s;
    cin >> s;
    if (s == "no") {
      for (int j = 2 * i; j < 101; j += i) {
        isDiv[j] = 1;
      }
    } else {
      ans++;
    }
    if (cnt == 20) break;
  }
  cout << (ans > 1 ? "composite" : "prime") << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  sieve();
  return 0;
}
