#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000 * 1000 * 1000 + 7;
void solve() {
  long long arr[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
  long long arr1[] = {4, 9, 25, 49};
  for (long long i = 0; i < 4; i++) {
    cout << arr1[i] << endl;
    string s1;
    cin >> s1;
    if (s1 == "yes") {
      cout << "composite";
      cout << endl;
      return;
    }
  }
  long long count = 0;
  for (long long i = 0; i < 15; i++) {
    cout << arr[i] << endl;
    string s;
    cin >> s;
    if (s == "yes") {
      count++;
    }
    if (count >= 2) {
      cout << "composite";
      cout << endl;
      return;
    }
  }
  cout << "prime";
  cout << endl;
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
