#include <bits/stdc++.h>
#define _for(i, a, b) for (int i = a; i <= b; ++i)
#define for_(i, a, b) for (int i = a; i >= b; --i)
#define far(i, vec) for (auto i : vec)
#define bdmd int mid = (l + r) >> 1
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef std::pair <int, int> pii;
typedef std::pair <ll, ll> pll;
const int N = 1e5 + 10, P = 998244353;
namespace IO {
	int rnt () {
		int x = 0, w = 1; char c = getchar ();
		while (!isdigit (c)) { if (c == '-') w = -1; c = getchar (); }
		while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
		return x * w;
	}
}
namespace SOLVE {
	using namespace IO;
	std::mt19937 rnd (3691);
	int Que (int len) {
		printf ("walk %d\n", len);
		fflush (stdout);
		return rnt ();
	}
	void Ans (int n) {
		assert (n > 0);
		assert (n <= 1000'000'000);
		printf ("guess %d\n", n);
		fflush (stdout);
		return;
	}
	void Main () {
		int M = 0;
		std::unordered_map <int, int> vis;
		_for (t, 1, 3000) M = std::max (M, Que (((unsigned int)rnd ()) % 1000'000'000));
		_for (i, 0, 3199) {
			int p = Que (1);
			if (vis.count (p))
				return Ans (i);
			else
				vis[p] = i + 1;
		}
		int p = Que (M);
		if (vis.count (p))
			return Ans (M + 3200 - vis[p]);
		else {
			_for (t, 2, 3200) {
				int p = Que (3200);
				if (vis.count (p))
					return Ans (M + 3200 * t - vis[p]);
			}
		}
		return;
	}
}
int main () {
	SOLVE::Main ();
	return 0;
} /*

*/