#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 110000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int now;
LL ans, base = 1;
int cal(LL x) {
	int res = 0;
	while (x) res += x % 10, x /= 10;
	return res;
}
int ask(LL x) {
	cout << "query " << x << endl;
	fflush(stdout);
	int res;
	cin >> res;
	// res = cal(19181819191LL + x);
	return res;
}
int main() {
	IO;
	now = ask(0);
	repn(i, 1, 18) {
		int l = 1, r = 9, res = 10;
		while (l <= r) {
			int mid = (l + r) / 2;
			int cur = ask(mid * base);
			if (cur < now + mid) r = mid - 1, res = mid;
			else l = mid + 1;
		}
		ans += base * (10 - res);
		base *= 10;
	}
	cout << "answer " << ans << endl;
	fflush(stdout);
	return 0;
}