/* Code by Heratino & Nelofus */
// No I still can't seem to
// Sing more than blues when it's time for my verse
// It's true that I need you
// To turn my blues into bursting fireworks
#include <bits/stdc++.h>
using i64 = long long;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
std::uniform_int_distribution<i64> gen(1, (int)1e9);

int main() {
	auto walk = [&](i64 x) -> i64 {
		std::cout << "walk " << x << std::endl;
		std::cin >> x;
		return x;
	};
	auto guess = [&](i64 x) -> void {
		std::cout << "guess " << x << std::endl;
	};
	i64 m = 0, lst;
	std::map<i64, i64> mp;
	for (int i = 1; i <= 3333; i++)
		lst = walk(gen(rng)), m = std::max(lst, m);
	mp[lst] = 0;
	for (int i = 1; i <= 3333; i++) {
		i64 t = walk(1);
		if (mp.count(t)) {
			guess(i - 1);
			return 0;
		}
		mp[t] = i;
	}
	i64 cnt = m;
	walk(m);
	for (int i = 1; i <= 3333; i++) {
		i64 t = walk(3333);
		cnt += 3333;
		if (mp.count(t)) {
			guess(cnt - mp[t]);
			return 0;
		}
	}
	assert(0);
	return 0;
}