#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mpr make_pair
#define rep(i,n) for(int i=1;i<=n;i++)
#define repe(i,l,r) for(int i=l;i<=r;i++)
#define FOR(i,r,l) for(int i=r;i>=l;i--)
#define pii pair<int,int>
#define ALL(v) v.begin(),v.end()
using namespace std;
void chkmax(int& x,int y){x=x>y? x:y;}
void chkmin(int& x,int y){x=x>y? y:x;}
unordered_map<int,int> vis;
mt19937 rnd(time(0));
int rd(int l,int r){
	return rnd()%(r-l+1)+l;
}
int walk(int x){
	printf("walk %d\n",x);
	cout.flush();
	cin>>x;
	return x;
}
const int inf=1e9;
signed main(){
	int x,mx=1;
	for(int i=1;i<=3000;i++){
		mx=max(mx,walk(rd(1,inf)));
	}
	vis[mx]=0;
	for(int i=1;i<=4000;i++){
		int x=walk(1);
		if(vis.count(x)){
			printf("guess %d\n",i);
			return 0;
		}
		vis[x]=i;
	}
	x=walk(mx);
	int cnt=2999+mx;
	while(1){
		if(vis.count(x)){
			printf("guess %d\n",cnt-vis[x]);
			return 0;
		}
		cnt+=3000;
		x=walk(3000);
	}
	return 0;
}