// Problem: O. Guess Cycle Length
// Author: XZC(L_Wave)
// Language: Cpp/G++20
// Contest: Hydro
// URL: http://www.nfls.com.cn:10611/p/16533?tid=67333207920ee48161ddde7f
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// Create Time: not 2024-11-13 09:48:04, but 1926-08-17 11:45:14
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i <= i##ABRACADABRA; i++)
#define drep(i, a, b) for (int i = (a), i##ABRACADABRA = (b); i >= i##ABRACADABRA; i--)
using namespace std;
using ll = long long;

int walk(int x){
  printf("walk %d\n",x);
  fflush(stdout);
  scanf("%d",&x);
  return x;
}

mt19937 rng(time(0));
map<int,int>M;

int main() {
  int res=0,cur;
  rep(i,1,3333)res=max(res,walk(rng()%1000000001));
  rep(i,1,3333){
    int u=walk(1);
    if (M.count(u))return printf("guess %d\n",i-M[u]),0;
    M[u]=i;
  }
  cur=walk(res);
  rep(i,1,3333){
    res+=3333;
    if (M.count(cur))return printf("guess %d\n",res-M[cur]),0;
    cur=walk(3333);
  }
  return 0;
}