#include <bits/stdc++.h>
using namespace std;
int64_t mod = 1e9 + 7;
int64_t mod1 = 1e9 + 6;
int64_t power(int64_t a, int64_t b) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return power((((a % mod) * (a % mod)) % mod), b / 2) % mod;
  else
    return ((a % mod) * (power((((a % mod) * (a % mod)) % mod), b / 2) % mod)) %
           mod;
}
bool check(int64_t p) {
  for (int64_t i = 2; i <= sqrt(p); ++i)
    if (p % i == 0) return false;
  return true;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  vector<int64_t> v;
  for (int64_t i = 2; i <= 50; ++i) {
    if (check(i)) v.push_back(i);
  }
  int64_t c = 0;
  int64_t x = 0;
  for (int64_t i = 0; i < v.size(); ++i) {
    cout << v[i] << '\n' << flush;
    string s;
    cin >> s;
    if (s == "yes") c++, x = v[i];
  }
  if (c <= 0) {
    cout << "prime" << '\n' << flush;
  } else if (c == 1) {
    if (x * x > 100) {
      cout << "prime" << '\n' << flush;
      return 0;
    }
    cout << x * x << '\n' << flush;
    string s;
    cin >> s;
    if (s == "yes") {
      cout << "composite" << '\n' << flush;
    } else
      cout << "prime" << '\n' << flush;
  } else {
    cout << "composite" << '\n' << flush;
  }
}
