#include<cstdio>
#include<iostream>
#include<random>
#include<map>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
bool debug=0;
int n,cur,p[10000000];
map <int,int> mp;
mt19937 rng(0x0d000721);
inline int randint(int l, int r)
{
    return uniform_int_distribution{l, r}(rng);
}
inline int ask(int x)
{
    if (x==0) x=randint(1,1000000000);
    if (debug)
    {
        (cur+=x)%=n; return p[cur];
    } else
    {
        printf("walk %d\n",x); fflush(stdout);
        int res; scanf("%d",&res); return res;
    }
}
inline void answer(CI x)
{
    printf("guess %d\n",x); fflush(stdout);
}
int main()
{
    if (debug)
    {
        scanf("%d",&n); cur=0;
        for (RI i=0;i<n;++i) p[i]=i;
        shuffle(p,p+n,rng);
    }
    int M=0;
    for (RI i=1;i<=3000;++i) M=max(M,ask(0));
    for (RI i=1;i<=3200;++i)
    {
        int pos=ask(1);
        if (mp.count(pos)) return answer(i-mp[pos]),0;
        mp[pos]=i;
    }
    int pos=ask(M);
    if (mp.count(pos)) return answer(M+3200-mp[pos]),0;
    for (RI i=1;i<=3200;++i)
    {
        int pos=ask(3200);
        if (mp.count(pos)) return answer(3200*i+M+3200-mp[pos]),0;
    }
    return 0;
}