#include <bits/stdc++.h>
using namespace std;
template <typename item>
item abs(item i) {
  if (i < 0) i = -i;
  return i;
}
template <class type>
type POW(type b, type p) {
  type res = 1;
  while (p) {
    if (p & 1) res *= b;
    b *= b;
    b %= 998244353;
    res %= 998244353;
    p /= 2;
  }
  return res;
}
int tc = 0;
long long arr[50];
long long n;
long long t;
vector<long long> temp, fst, snd;
bool isprime(int n) {
  for (int i = 2; i < n; i++)
    if (n % i == 0) return 0;
  return 1;
}
int main() {
  vector<int> prime;
  for (int i = 2; i <= 50; i++) {
    if (isprime(i)) prime.push_back(i);
  }
  string s;
  int cnt = 0;
  for (int i = 0; i < prime.size(); i++) {
    cout << prime[i] << "\n";
    fflush(stdout);
    cin >> s;
    if (s == "yes") {
      cnt++;
      if (prime[i] * prime[i] >= 100) continue;
      cout << prime[i] * prime[i] << "\n";
      fflush(stdout);
      cin >> s;
      if (s == "yes") cnt++;
    }
  }
  if (cnt >= 2) {
    cout << "composite";
    fflush(stdout);
    return 0;
  }
  cout << "prime";
  fflush(stdout);
  return 0;
}
