#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 1;
const int INF = 1e9 + 1;
const int MOD = 1e9 + 7;
const int szT = (1 << 17) - 1;
const double PI = acos(-1.0);
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
int cnt;
vector<int> p, d;
int main() {
  ios_base ::sync_with_stdio(0);
  for (int i = 2; i <= 50; ++i) {
    bool prime = 1;
    for (int j = 2; j * j <= i; ++j) {
      if (i % j == 0) {
        prime = 0;
        break;
      }
    }
    if (prime) {
      p.push_back(i);
    }
  }
  for (int i = 0; i < (int)p.size(); ++i) {
    if (p[i] * p[i] > 100) break;
    d.push_back(p[i] * p[i]);
  }
  for (int i = 0; i < (int)d.size(); ++i) {
    cout << d[i] << endl;
    string s;
    cin >> s;
    if (s == "yes") {
      cout << "composite" << endl;
      return 0;
    }
  }
  for (int i = 0; i < (int)p.size(); ++i) {
    cout << p[i] << endl;
    string s;
    cin >> s;
    if (s == "yes") {
      ++cnt;
      if (cnt == 2) {
        cout << "composite" << endl;
        return 0;
      }
    }
  }
  cout << "prime" << endl;
  return 0;
}
