#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf INT_MAX
#define fr(i,l,r) for (i=(l); i<=(r); i++)
#define rfr(i,l,r) for (i=(l); i>=(r); i--)
template<typename T>inline void read(T &n){
    T w=1; n=0; char ch=getchar();
    while (!isdigit(ch) && ch!=EOF){ if (ch=='-') w=-1; ch=getchar(); }
    while (isdigit(ch) && ch!=EOF){ n=(n<<3)+(n<<1)+(ch&15); ch=getchar(); }
    n*=w;
}
template<typename T>inline void write(T x){
    if (x==0){ putchar('0'); return ; }
    T tmp;
    if (x>0) tmp=x;
    else tmp=-x;
    if (x<0) putchar('-');
    char F[105];
    long long cnt=0;
    while (tmp){
        F[++cnt]=tmp%10+48;
        tmp/=10;
    }
    while (cnt) putchar(F[cnt--]);
}
#define Min(x,y) x = min(x,y)
#define Max(x,y) x = max(x,y)
struct Suiji{
    #define R ((ll)rand())
    Suiji(){
        srand((unsigned)time(NULL));
        return ;
    }
    ll rrr(){
        return R*R*R*R+R*R*R+R*R+R;
    }
    ll M(ll l,ll r){
        ll ans,mod;
        ans=rrr();
        mod=r-l+1;
        ans=(ans%mod+mod)%mod;
        return ans+l;
    }
}suiji;
#define M(l,r) (suiji.M(l,r))
//基础配置=================================================================================
const ll B = 3005;
map<ll,ll> mp;
ll qry(ll x){
    printf("walk %lld\n",x); fflush(stdout);
    read(x); return x;
}
void Gus(ll x){
    printf("guess %lld\n",x); exit(0);
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
    ll i,j;
    ll mx = 0;
    fr(i,1,B) Max(mx,qry(M(1,1e9)));
    fr(i,1,B){
        ll x = qry(1);
        if (mp.count(x)) Gus(i-mp[x]);
        mp[x] = i;
        max(mx,x);
    }
    if (mx>B) qry(mx-B);
    ll d = mx;
    while (1){
        d += B;
        ll x = qry(B);
        if (mp.count(x)) Gus(d-mp[x]);
    }
    return 0;
}
//g++ a.cpp -o a -Wall -Wl,--stack=512000000 -std=c++11 -O2