#include <bits/stdc++.h>
using namespace std;
const long long int N = 2e5 + 5;
bool checkprime(long long int x) {
  if (x == 1) {
    return false;
  }
  for (long long int i = 2; i * i <= x; i++) {
    if (x % i == 0) {
      return false;
    }
  }
  return true;
}
long long int query(long long int x) {
  cout << x << "\n";
  cout.flush();
  string s;
  cin >> s;
  if (s == "yes") {
    return 1;
  }
  return 0;
}
void solve() {
  long long int cnt = 0;
  for (long long int i = 2; i <= 50; i++) {
    if (cnt >= 2) {
      break;
    }
    if (checkprime(i) && query(i) == 1) {
      cnt++;
      if (i < 11 && query(i * i) == 1) {
        cnt++;
      }
    }
  }
  if (cnt >= 2) {
    cout << "composite"
         << "\n";
    return;
  }
  cout << "prime"
       << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) solve();
  return 0;
}
