#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int a[15] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
  int c = 0;
  int i = 0;
  string s;
  vector<pair<int, string> > v;
  while (i < 15) {
    cout << a[i];
    cout << "\n";
    cout << flush;
    cin >> s;
    if (s == "yes") {
      c++;
      v.push_back(make_pair(i, s));
    }
    if (c > 1) {
      cout << "composite";
      return 0;
    }
    i++;
  }
  if (c == 0) {
    cout << "prime";
    return 0;
  } else {
    int x = a[v[0].first];
    if (x > 7) {
      cout << "prime";
      return 0;
    }
    cout << x * x;
    cout << "\n" << flush;
    cin >> s;
    if (s == "yes")
      cout << "composite";
    else
      cout << "prime";
  }
  return 0;
}
