#include <bits/stdc++.h>
using namespace std;
long long n, m, k, a, b, c, d, e, f, g, h, q, p, mx,
    l[19] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29,
             31, 37, 41, 43, 47, 4,  9,  25, 49};
string s, ss, s1, s2, t;
char ch;
int ispalindrome(string s) {
  string q = s;
  reverse(q.begin(), q.end());
  if (q == s) {
    return 1;
  } else {
    return 0;
  }
}
int main() {
  for (int i = 0; i < 19; i++) {
    cout << l[i] << endl;
    cin >> s;
    if (s == "yes") {
      a++;
    }
  }
  if (a > 1) {
    cout << "composite" << endl;
  } else {
    cout << "prime" << endl;
  }
}
