#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
// #define int long long
typedef long long LL;

inline int read(){
	int x = 0 , f = 1 ; char c = getchar() ;
    while( c < '0' || c > '9' ) { if( c == '-' ) f = -1 ; c = getchar() ; } 
    while( c >= '0' && c <= '9' ) { x = x * 10 + c - '0' ; c = getchar() ; } 
    return x * f ;
}

const int maxn = 1e4+20;
const int mod = 1e9;
int cnt;
int w[maxn],p[maxn];
map<int,int> M;
mt19937 rd(time(0));
int Rand(){
    return rd() % mod + 1;
}

void walk(int N){
    cout<<"walk "<<N<<endl;
    // cout.flush();
}

void solve(){
    int m = 0;
    for(int i=1;i<=3332;i++){
        walk(Rand());
        int x;
        cin >> x;
        m = max(m,x);
    }
    cnt = 0;
    for(int i=1;i<=3333;i++){
        w[++cnt] = 1;
        walk(w[cnt]);
        cin >> p[cnt];
        if(M[p[cnt]]){
            int ans = 0;
            for(int j=M[p[cnt]] + 1;j <= cnt;j++){
                ans += w[j];
            }
            cout << "guess " << ans << endl;
            // cout.flush();
            return ;
        }
        M[p[cnt]] = cnt;
    }
    w[++cnt] = m;
    walk(w[cnt]);
    cin >> p[cnt];
    if(M[p[cnt]]){
        int ans = 0;
        for(int j=M[p[cnt]] + 1;j <= cnt;j++){
            ans += w[j];
        }
        cout << "guess " << ans << endl;
        // cout.flush();
        return ;
    }
    M[p[cnt]] = cnt;
    for(int i=1;i<=3333;i++){
        w[++cnt] = 3333;
        walk(w[cnt]);
        cin >> p[cnt];
        if(M[p[cnt]]){
            int ans = 0;
            for(int j=M[p[cnt]] + 1;j<=cnt;j++){
                ans += w[j];
            }
            cout << "guess " << ans << "\n";
            cout.flush();
            return ;
        }
        M[p[cnt]] = cnt;
    }
}

signed main(){
	// freopen("1.txt","r",stdin);
	int T = 1;
	// T = read();
	while(T--) solve();
	return 0;
}