#include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7;
long long a[1000005], n;
bool isprime(int k) {
  for (int i = 2; i < k; ++i)
    if (k % i == 0) return false;
  return true;
}
int main() {
  long long q, m, k, h, ans = 0, sum = 0, p, x, y;
  vector<int> v;
  for (int i = 2; i < 51; ++i)
    if (isprime(i)) v.push_back(i);
  for (int i = 0; i < 15; ++i) {
    string r;
    cout << v[i] << endl;
    cin >> r;
    if (r == "yes") {
      ++ans;
      x = i;
    }
  }
  if (ans == 0) return cout << "prime", 0;
  if (ans > 1) return cout << "composite", 0;
  sum = v[x] * v[x];
  for (int i = 0; i < 5; ++i) {
    if (sum > 100) break;
    string r;
    cout << sum << endl;
    cin >> r;
    if (r == "yes") {
      return cout << "composite", 0;
    }
  }
  cout << "prime";
}
