#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}



//_ ***************************** START Below *******************************

//* Change this to false => before submitting to cf
// bool testing = true; 
bool testing = false;

vector<int> oddPrimes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};


int toGuess;

void hack(){
    cin >> toGuess;
}


string interactor(int x){
    return toGuess % x == 0 ? "yes" : "no";
}



string askQuery(int x){
    cout << x << endl;

    if(testing){
        cout << interactor(x) << endl;
        return interactor(x);
    }

    string isDivisor;
    cin >> isDivisor;
    return isDivisor;
}


string consistency(){

    if(testing){
        hack();
    }
    
    
    
    int q = 0;
    int ct = 0;
    string ans = "prime";

    for(auto& p : oddPrimes){
        string res = askQuery(p);
        q++;
        if(res == "yes"){
            ct++;
            if(ct == 2){
                ans = "composite";
                break;
            }
            
            if(p*p>50) continue;
            string res2 = askQuery(p*p);
            q++;
            if(res2 == "yes"){ 
                ans = "composite";
                break;
            }
        }
    }

    if(testing) cout << "Max Queries : " << q << endl;

    if(ans == "composite") return "composite";

    
    return ans;

}








void solve() {

    string ans = consistency();
    cout << ans << endl;

}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }


    return 0;
}