#include <bits/stdc++.h>
using namespace std;
void _print(long long t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
void _print(long long A[], long long s, long long e) {
  cerr << "[ ";
  for (long long i = s; i < e; i++) {
    _print(A[i]);
    cerr << " ";
  }
  cerr << "]";
}
long long mul(long long a, long long b) {
  return ((a % 1000000007) * (b % 1000000007)) % 1000000007;
}
long long sub(long long a, long long b) {
  return (((a - b) % 1000000007) + 1000000007) % 1000000007;
}
long long add(long long a, long long b) { return ((a + b) % 1000000007); }
long long power(long long x, long long y) {
  if (y == 0) return 1;
  long long p = power(x, y / 2) % 1000000007;
  p = (p * p) % 1000000007;
  return (y % 2 == 0) ? p : (x * p) % 1000000007;
}
long long modInverse(long long a) { return power(a, 1000000007 - 2); }
void solve();
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
bool prime[51];
void solve() {
  long long n = 50;
  memset(prime, true, sizeof(prime));
  for (long long p = 2; p * p <= n; p++)
    if (prime[p])
      for (long long i = p * p; i <= n; i += p) prime[i] = false;
  vector<long long> chk;
  chk.push_back(4);
  chk.push_back(9);
  chk.push_back(25);
  chk.push_back(49);
  for (long long i = 2; i < 50; i++)
    if (prime[i]) chk.push_back(i);
  long long cnt = 0;
  for (long long i = 0; i < 19; i++) {
    cout << chk[i] << endl;
    string s;
    cin >> s;
    if (s == "yes") cnt++;
  }
  if (cnt > 1)
    cout << "composite" << endl;
  else
    cout << "prime" << endl;
  return;
}
