#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define F first
#define S second
#define RE register
#define random(x) (rand() % (x))
#define LOG(a, b) (log(a) / log(b))
#define N 114514
#define mod 998244353
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3fll
ll a[N],b[N],mx=0,ans=0;
map<ll,ll> mp;
int main(){
	srand(time(0));
	//int i=0;
	for(int i=1;i<=3333;++i){
		a[i]=(rand()*65536ll+rand())%1000000001ll;
		printf("walk %lld\n",a[i]);fflush(stdout);
		a[i]+=a[i-1];
		scanf("%lld",b+i);
		mx=max(mx,b[i]);
		/*
		if(mp.find(b[i])!=mp.end()){
			ans=a[i]-mp[b[i]];
			printf("guess %lld\n",ans);
		}
		*/

	}
	a[3333]=0;
	mp[b[3333]]=a[3333];
	for(int i=3334;i<=6666;++i){
		a[i]=3333;
		if(a[i]+a[i-1]>=mx){
			a[6666]=a[i-1];
			break;
		}
		printf("walk %lld\n",a[i]);fflush(stdout);
		a[i]+=a[i-1];
		scanf("%lld",b+i);
		mp[b[i]]=a[i];
	}
	a[6667]=mx;
	printf("walk %lld\n",a[6667]);fflush(stdout);
	a[6667]+=a[6666];
	scanf("%lld",b+6667);
	if(mp.find(b[6667])!=mp.end()){
		ans=a[6667]-mp[b[6667]];
		printf("guess %lld\n",ans);
		return 0;
	}
	for(int i=6668;i<=10000;++i){
		a[i]=1;
		printf("walk %lld\n",a[i]);fflush(stdout);
		a[i]+=a[i-1];
		scanf("%lld",b+i);
		if(mp.find(b[i])!=mp.end()){
			ans=a[i]-mp[b[i]];
			printf("guess %lld\n",ans);
			return 0;
		}
	}
	return 0;
}