/**
 *    author:  pizzaroot
 *    created: 2024-11-13 03:10:26
**/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
const ll N = 10000000;
double prob(int m, int k) {
    return 1 - pow(1 - 1.0 * m / N, k);
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    vi arr; vector<double> pr;
    for (int i = 100; i <= N / 2; i *= 1.01) arr.push_back(i);
    for (auto &x: arr) pr.push_back(1.0 / arr.size());
    for (int _ = 0; _ < 50; _++) {
        int lo = 0, hi = N;
        while (lo < hi) {
            int k = lo + hi >> 1;
            double tot = 0;
            for (int idx = 0; idx < arr.size(); idx++) {
                tot += prob(arr[idx], k) * pr[idx];
            }
            if (tot < 0.5) lo = k + 1;
            else hi = k;
        }
        cout << "test " << lo << endl;
        int res; cin >> res;
        if (res) {
            for (int idx = 0; idx < arr.size(); idx++) {
                pr[idx] *= prob(arr[idx], lo) * 2;
            }
        } else {
            for (int idx = 0; idx < arr.size(); idx++) {
                pr[idx] = pr[idx] * (1 - prob(arr[idx], lo)) * 2;
            }
        }
    }
    double mp = *max_element(all(pr));
    for (int idx = 0; idx < arr.size(); idx++) {
        if (pr[idx] == mp) {
            cout << "estimate " << arr[idx] << endl; return 0;
        }
    }
}