#include <bits/stdc++.h>
using namespace std;
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unrolled-loops")
int num_div, a[110];
void solve() {
  int cnt = 21;
  for (int i = 2; i <= 100; i++) {
    if (a[i]) continue;
    if (--cnt == 0) break;
    cout << i << endl;
    string ans;
    cin >> ans;
    if (ans == "yes") {
      num_div++;
    } else {
      for (int j = i; j <= 100; j += i) a[j] = 1;
    }
  }
  if (num_div > 1)
    cout << "composite" << endl;
  else
    cout << "prime";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
}
