#include <bits/stdc++.h>
using namespace std;
vector<int> v;
string st;
int ans, cnt;
bool f[105];
bool su(int x) {
  for (int i = 2; i < x; ++i)
    if (x % i == 0) return false;
  return true;
}
int main(void) {
  for (int i = 2; i <= 100; ++i)
    if (su(i)) v.push_back(i);
  for (int i = 0; i < v.size(); ++i) {
    if (f[v[i]]) continue;
    ++cnt;
    if (cnt >= 20) {
      cout << "prime" << endl;
      return 0;
    }
    cout << v[i] << endl;
    fflush(stdout);
    cin >> st;
    if (st == "no") continue;
    for (int j = i; j < v.size(); ++j) {
      if (v[i] * v[j] > 100) break;
      ++cnt;
      if (cnt >= 20) {
        cout << "prime" << endl;
        return 0;
      }
      cout << v[i] * v[j] << endl;
      ++ans;
      fflush(stdout);
      cin >> st;
      if (st == "yes") {
        cout << "composite" << endl;
        return 0;
      }
      f[v[j]] = true;
    }
  }
  return 0;
}
