#include <bits/stdc++.h>
using namespace std;
const bool test = false;
const bool pre_ = false;
const int N = 10000000;
int a[N], id[N];
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const std::random_device rd;
void randid() { shuffle(id, id + N, rnd); }
struct Interator {
    int y, query_cnt = 0;
    void init() {
        query_cnt = 0;
        if (test) {
            y = rnd() % (5'000'0 - 100 + 1) + 100;
            y = 22000;
            randid();
            memset(a, 0, sizeof(a));
            for (int i = 0; i < y; i++) a[id[i]] = 1;
            //  cout << "color id=" << id[i] << endl;
            cout << "answer = " << y << endl;
        } else {
        }
    }
    int query(int x) {
        query_cnt++;
        assert(query_cnt <= 50);
        cout << "test " << x << endl;
        if (!test) {
            int z;
            cin >> z;
            return z;
        } else {
            randid();
            int res = 0;
            for (int i = 0; i < x; i++) {
                res |= a[id[i]];
                // cout << "id=" << id[i] << " res=" << res << endl;
            }
            // cout << "res=" << res << endl;
            return res;
        }
    }
    void answer(int x) {
        cout << "estimate " << x << endl;
        if (test && !((x <= 2 * y && y <= 2 * x))) {
            cout << "WA y=" << y << " x=" << x << endl;
            exit(0);
        }
    }
} sol;
vector<int> ans, q;
void solve() {
    sol.init();

    auto check = [&](int x) {
        double t = (double)x / N, now = 1;
        int g = 0;
        while (now > 0.55) {
            now *= (1. - t);
            g++;
            // cout << "now=" << now << " g=" << g << " t=" << t << endl;
        }
        if (sol.query(g))
            return false;
        else
            return true;
    };
    double res = 0;
    double l = log2(1), r = log2(N);
    for (int T = 1; T <= 50 && l <= r; T++) {
        double mid = (l + r) / 2;
        res = mid;
        if (test) cout << "l=" << l << " r=" << r << endl;
        if (check(pow(2, mid))) {
            r -= (r - l) / 20;
        } else {
            l += (r - l) / 20;
        }
    }
    sol.answer(pow(2, res));
}
int main() {
    int T = 1;
    iota(id, id + N, 0);
    if (test) T = 1000;
    while (T--) solve();
}