#include <bits/stdc++.h>
using namespace std;
struct hash_pair {
  template <class T1, class T2>
  size_t operator()(const pair<T1, T2>& p) const {
    auto hash1 = hash<T1>{}(p.first);
    auto hash2 = hash<T2>{}(p.second);
    return hash1 ^ hash2;
  }
};
bool prime[10000001];
long long P = 1000000007 - 2;
long long factorial[10000001] = {0};
long long powerFunction(long long x, long long y) {
  long long res = 1;
  long long p = 1000000007;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void sieveFunction(long long maxLimit) {
  memset(prime, true, sizeof(prime));
  prime[0] = prime[1] = false;
  for (long long i = 2; maxLimit >= i; i++) {
    if (prime[i]) {
      for (long long j = 2 * i; maxLimit >= j; j += i) prime[j] = false;
    }
  }
}
void factorialFunction(long long maxLimit) {
  factorial[0] = 1;
  for (long long i = 1; i <= maxLimit; i++)
    factorial[i] = (factorial[i - 1] * i) % 1000000007;
  return;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
signed main() {
  sieveFunction(101);
  while (true) {
    map<long long, bool> mp;
    cout << 2 << "\n";
    string ans;
    cin >> ans;
    long long count = 0;
    if (ans == "yes") {
      mp[2] = true;
      count++;
    }
    cout << 3 << "\n";
    cin >> ans;
    if (ans == "yes") {
      mp[3] = true;
      count++;
    }
    cout << 5 << "\n";
    cin >> ans;
    if (ans == "yes") {
      mp[5] = true;
      count++;
    }
    cout << 7 << "\n";
    cin >> ans;
    if (ans == "yes") {
      mp[7] = true;
      count++;
    }
    if (count == 0) {
      cout << "prime\n";
      return 0;
    } else if (count == 1) {
      bool fg = true;
      for (long long i = 4; 49 >= i; i++) {
        if (i == 4 || i == 9 || i == 25 || i == 49) {
          cout << i << "\n";
          string ans;
          cin >> ans;
          if (ans == "yes") {
            fg = false;
            mp[i] = true;
          }
        }
      }
      for (long long i = 11; 50 > i; i++) {
        if (prime[i]) {
          cout << i << "\n";
          string ans;
          cin >> ans;
          if (ans == "yes") {
            fg = false;
            mp[i] = true;
          }
        }
      }
      if (fg) {
        cout << "prime\n";
        return 0;
      } else {
        cout << "composite\n";
        return 0;
      }
    } else {
      cout << "composite\n";
      return 0;
    }
  }
}
