#include <iostream>
#include <cmath>
using namespace std;

bool isPrime(int a) {
    for (int i = 2; i * i <= a; ++i)
        if (a % i == 0)
            return false;
    return true;
}

bool isDivisible(int a) {
    cout << a << endl;
    cout.flush();
    string res;
    cin >> res;
    return res[0] == 'y' || res[0] == 'Y';
}

int main() {
    int c = 0;
    int h = 100;

    for (int i = 2; i <= 10 && c < 2; ++i) {
        if (isPrime(i) && isDivisible(i)) {
            ++c;
            if (c >= 2) {
                cout << "composite" << endl;
                return 0;
            }
        }
    }

    if (c < 2) {
        int p[] = {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
        for (int pr : p) {
            if (isDivisible(pr)) {
                ++c;
                if (c >= 2) {
                    cout << "composite" << endl;
                    return 0;
                }
            }
        }
    }

    cout << (c >= 2 ? "composite" : "prime") << endl;
    return 0;
}