#include <bits/stdc++.h>
using namespace std;
const int INF = (int)(1e9);
const long long INF64 = (long long)(1e18);
const long double EPS = 1e-9;
const long double PI = 3.1415926535897932384626433832795;
int main() {
  int primes[16] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
  int divisibleBy = 0;
  vector<int> whoDivided;
  for (int i = 0; i < 15; ++i) {
    cout << primes[i] << endl;
    string str;
    cin >> str;
    if (str == "yes") {
      divisibleBy++;
      whoDivided.push_back(primes[i]);
    }
  }
  if (divisibleBy == 0) {
    cout << "prime" << endl;
  } else {
    if (divisibleBy > 1)
      cout << "composite" << endl;
    else {
      int prime = whoDivided[0];
      if (prime * prime <= 100) {
        cout << prime * prime << endl;
        string str;
        cin >> str;
        if (str == "yes")
          cout << "composite" << endl;
        else
          cout << "prime" << endl;
      } else {
        cout << "prime" << endl;
        return 0;
      }
    }
  }
  return 0;
}
