/*
 * tmp.cpp 2023-10-19
 * Copyright (C) 2023 Woshiluo Luo <[email protected]>
 *
 * 「Two roads diverged in a wood,and I—
 * I took the one less traveled by,
 * And that has made all the difference.」
 *
 * Distributed under terms of the GNU GNU AGPLv3+ license.
 */

#include <cstdio>
#include <cstdlib>
#include <cstdint>
#include <cstring>

#include <map>
#include <random>
#include <vector>
#include <algorithm>

typedef const int cint;
typedef uint32_t uint;
typedef long long ll;
typedef unsigned long long ull;

inline bool isdigit( const char cur ) { return cur >= '0' && cur <= '9'; }/*{{{*/
template <class T> 
T Max( T a, T b ) { return a > b? a: b; }
template <class T> 
T Min( T a, T b ) { return a < b? a: b; }
template <class T> 
void chk_Max( T &a, T b ) { if( b > a ) a = b; }
template <class T> 
void chk_Min( T &a, T b ) { if( b < a ) a = b; }
template <class T> 
T aabs( T a ) { return a < 0? -a: a; }
template <typename T>
T read() { 
	T sum = 0, fl = 1; 
	char ch = getchar();
	for (; isdigit(ch) == 0; ch = getchar())
		if (ch == '-') fl = -1;
	for (; isdigit(ch); ch = getchar()) sum = sum * 10 + ch - '0';
	return sum * fl;
}
template <class T> 
T pow( T a, int p ) {
	T res = 1;
	while( p ) {
		if( p & 1 ) 
			res = res * a;
		a = a * a;
		p >>= 1;
	}
	return res;
}/*}}}*/


std::random_device seed;
std::mt19937_64 rnd(seed());


// int walk( unsigned int x ) {
// 	printf( "walk %d\n", x );
// 	fflush(stdout);
// 	cint res = read<int>();
// 	return res;
// }
//

int gen( cint l, cint r ) {
	return ( rnd() % ( r - l ) ) + l;
}

int n = 19260817;
ll cur = 0;
int walk( unsigned int x ) {
	cur += x;
	cur %= n;
	return cur;
}

void guess( cint p ) {
	printf( "guess %d\n", p );
	fflush(stdout);
	std::exit(0);
}

ll gcd( ll a, ll b ) { return b? gcd( b, a % b ): a; }

int main() {
#ifdef woshiluo
	freopen( "tmp2.in", "r", stdin );
	freopen( "tmp2.out", "w", stdout );
#endif

	cur = 0;
	std::map<int, ll> mp;
	unsigned long long sum = 0;
	int k = 3333;
	int min = 0;
	for( int i = 0; i < k; i ++ ) {
		chk_Max( min, walk( gen( 1, 1e9 ) ) );
	}

	for( int i = 0; i < k; i ++ ) {
		int current = walk(1);
		sum += 1;
		if( mp.count(current) ) {
			guess( sum - mp[current] );
		}
		mp[current] = sum;
	}

	int current = walk(min); sum += min;
	for( int i = 0; i < k; i ++ ) {
		if( mp.count(current) ) {
			guess( sum - mp[current] );
		}
		mp[current] = sum;

		current = walk(k);
		sum += k;
	}

	return -1;
}