#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
vector<int> p;
bool prime_test(int n) {
  if (n <= 1) return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
string ask(int x) {
  cout << x << "\n";
  cout << flush;
  string a;
  cin >> a;
  return a;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  for (int i = 2; i <= 100; i++) {
    if (prime_test(i)) p.push_back(i);
  }
  int cnt = 0;
  for (int i = 0; i < 16; i++) {
    if (ask(p[i]) == "yes") {
      cnt++;
    }
  }
  for (auto x : {4, 9, 25, 49}) {
    if (ask(x) == "yes") {
      cnt++;
    }
  }
  cout << (cnt <= 1 ? "prime" : "composite") << "\n";
  return 0;
}
