#include <bits/stdc++.h>   using namespace std;   bool able[105], prime[105], left[105], flag = 0;   int least = 1;   string tp;   bool isPrime(int i) {     int to = int(sqrt(double(i) + 1.0));     if (i == 1 || i == 2 || i == 5) return 1;     for (int j = 2; j <= to; j++)       if (i % j == 0) return 0;     return 1;   }   int main() {     for (int i = 1; i <= 100; i++)       if (isPrime(i)) prime[i] = 1;     for (int i = 2; i <= 50; i++) {       if (prime[i] == 0) continue;       cout << i << endl;       cin >> tp;       if (tp[0] ==  y ) {         if (flag == 1) {           cout <<  composite  << endl;           fflush(stdout);           return 0;         }         if (i >= 11) {           cout <<  prime  << endl;           fflush(stdout);           return 0;         }         flag = 1;         cout << i * i << endl;         cin >> tp;         if (tp[0] ==  y ) {           cout <<  composite  << endl;           fflush(stdout);           return 0;         }       }     }     cout <<  prime  << endl;     fflush(stdout);     return 0;   }   