#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll B=1e3,N=1e9;
ll Q(ll x){
    cout<<"walk "<<x<<endl;
    ll res;cin>>res;
    return res;
}
void A(ll x){
    cout<<"guess "<<x<<endl;
    exit(0);
}
mt19937 rnd(time(0));
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    ll mx=0;
    rep(i,1,B)mx=max(mx,Q(rnd()%N));
    map<ll,ll>mp;
    ll cnt=0,x=0;
    rep(i,1,B){
        x=Q(1),cnt++;
        if(mp.count(x))A(cnt-mp[x]);
        mp[x]=cnt;
    }
    if(mx>B)cnt+=mx-B,x=Q(mx-B);
    while(!mp.count(x))cnt+=B,x=Q(B);
    A(cnt-mp[x]);
    cerr<<"\n"<<clock()*1.0/CLOCKS_PER_SEC*1000<<"ms\n";
    return 0;
}