#include <bits/stdc++.h>
#define dd(x) cout << #x << "\n"
#define d(x) cout << #x  << ": " << x << "\n"
#define SZ(x) ((int)(x).size())
using namespace std;
#define int long long
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using a3 = array<int, 3>;
using ll = long long;
const int inf = 0x3f3f3f3f3f3f3f3fLL;

// #define MULTI_TEST
//
const int mod = 1e9;
mt19937 rng(19260817);
int cntx;
void solve() {
    auto ask = [&](int x) {
        assert(x <= mod);
        assert(x >= 0);
        ++cntx;
        assert(cntx <= 10000);
        cout << "walk " << x << endl;
        int res; cin >> res;
        return res;
    };

    int now = ask(0);
    int maxx = now;
    for(int i = 1; i <= 3000; i++) {
        int x = ask(rng() % mod);
        maxx = max(maxx, x);
    }

    if(maxx <= 5000) {
        for(int i = 1; i <= 6000; i++) {
            int ne = ask(i);
            if(now == ne) {
                cout << "guess " << i << endl;
                return ;
            }
            now = ne;
        }
        assert(false);
        return ;
    }

    int minx = maxx;
    // maxx = 10 + minx / (255.0 / 256);
    if(ask(minx) == ask(minx)) {
        cout << minx << "\n";
        return ;
    }

    vector<int> query((int)1e4);
    for(int i = 1; i <= 3333; i++) {
        query[i] = 1;
    }

    query[3334] = minx;
    for(int i = 3335; i <= 6667; i++) {
        query[i] = 3333;
    }

    map<int, int> maps;
    maps[now] = 0;
    vector<int> sum((int)1e4);
    for(int i = 1; i <= 6667; i++) {
        sum[i] = sum[i - 1] + query[i];
        int ne = ask(query[i]);
        
        if(ne == now) {
            cout << "guess " << query[i] << endl;
            return ;
        }

        if(maps.count(ne)) {
            int lst = maps[ne];
            int n = sum[i] - sum[lst];

            // for(int j = 100; j >= 2; j--) {
            //     if(n % j == 0 && ask(n / j) == ask(n / j)) {
            //         cout << "guess " << n / j << endl;
            //         return ;
            //     }
            // }
            // for(int j = 1; j <= n; j++) {
            //     assert(ask(n) == ask(n));
            //     int kk = n / j;
            //     if(minx <= kk && kk <= maxx && ask(n / j) == ask(n / j)) {
            //         cout << "guess " << n / j << endl;
            //         return ;
            //     }
            // }
            cout << "guess " << n << endl;
            return ;
        }

        now = ne;
        maps[now] = i;
    }
    assert(false);
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
#ifdef MULTI_TEST
    int T; cin >> T;
#else
    int T = 1;
#endif
    while(T--) solve();
    return 0;
}