/*
 * author: weiyutang
 */

#include <bits/stdc++.h>
using namespace std;

/* ===== BEGIN USER CODE ===== */

#define ll long long
#define ld long double
#define f first
#define s second

const int MOD = 1e9 + 7;
const vector<vector<int>> dirs4 {{0,1}, {1,0}, {-1,0}, {0,-1}};
const vector<vector<int>> dirs8 {{0,1}, {1,0}, {-1,0}, {0,-1}, {-1,-1}, {-1,1}, {1,-1}, {1,1}};

void solve() {
	int n = 18;
	vector<int64_t> digit(n, 0);

	int64_t start;
	cout << "query " << 0 << endl;
	cin >> start;

	int64_t pow_10 = 1;
	for (int i = 0; i < n; i++) {
		int64_t lt = 1, rt = 10;
		int64_t resp;	

		while (lt < rt) {
			int64_t mid = lt + (rt - lt) / 2;
	
			cout << "query " << mid * pow_10  << endl;
			cin >> resp;

			if (resp < start) {
				rt = mid;
			} else {
				lt = mid + 1;
			}
		}
	
		// cout << "digit[" << i << "]: " << (10 - rt) % 10 << endl;
		digit[i] = (10 - rt) % 10;
		pow_10 *= 10;
	}

	int64_t ans = 0;
	for (int i = n - 1; i >= 0; i--) {
		ans *= 10;
		ans += digit[i];
	}

	cout << ans << endl;
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    srand(chrono::steady_clock::now().time_since_epoch().count());

    int t = 1;
    // cin >> t;

    while (t--) {
		solve();
	}

    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl; 
    return 0;
}