#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int M = 1e9;
const int K1 = 2000;
const int K2 = 3000;

mt19937 rng;
LL s;
unordered_map<int, LL> mp;
LL n = -1;

int ask(int x) {
	cout << "walk " << x << endl;
	s += x;
	int v;
	cin >> v;
	if (n == -1 && mp.count(v) && s != mp[v] && s - mp[v] < 2e9) {
		n = s - mp[v];
	}
	mp[v] = s;
	return v;
}


int main()
{
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	int mx = 0;
	FOR(i, 0, K1) {
		int x = rng() % M;
		mx = max(mx, ask(x));
	}
	FOR(i, 0, K2) {
		ask(K2);
	}
	ask(mx);
	FOR(i, 0, K2) {
		ask(1);
	}
	assert(n != -1);
	LL nn = n;
	vector<int> primes;
	for (LL p = 2; p * p <= nn; p++) {
		if (nn % p == 0) {
			primes.push_back(p);
			while (nn % p == 0) {
				nn /= p;
			}
		}
	}
	if (nn > 1) {
		primes.push_back(nn);
	}
	int v = ask(47);
	for (int p : primes) {
		while (n % p == 0) {
			int u = ask(n / p);
			if (u == v) {
				n /= p;
				v = u;
			}
			else {
				v = u;
				break;
			}
		}
	}
	cout << "guess " << n << endl;
	return 0;
}