// Such a destiny was not desired.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

constexpr int N = 1e9;

inline int ask(int x) {
  cout << "walk " << x << endl;
  int p; cin >> p;
  return p;
}
inline void answer(int x) {
  cout << "guess " << x << endl;
  exit(0);
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

map<int, int> rec;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  
  int T = 3333;
  int p = -1, last = -1;
  while(T--) {
    last = ask(rng() % N + 1);
    p = max(p, last);
  }

  rec[last] = 0;
  for(int i = 1; i <= 3333; i++) {
    int t = ask(1);
    if(rec.find(t) == rec.end()) rec[t] = i;
    else answer(i - rec[t]);
  }
  int u = ask(p), s = p;
  if(rec.find(u) != rec.end()) answer(s + 3333 - rec[u]);

  for(int i = 1; i <= 3333; i++) {
    int t = ask(3333); s += 3333;
    if(rec.find(t) != rec.end()) {
      answer(s + 3333 - rec[t]);
    }
  }
  assert(0);
}