#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1e5;
const int d = 199;
const db EPS = 1e-7;
int cnt = 0;


db q(int x1, int y1, int x2, int y2, int t)
{
	if (t)
	{
		swap(x1, y1);
		swap(x2, y2);
	}
	cnt++;
	assert(cnt <= 1024);
	cout << "query " << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
	db ans;
	cin >> ans;
	return ans;
}

db f(int x1, db d1, int x2, db d2, int t)
{
	//d1 = q(x1, 0, x1, N, t);
	//d2 = q(x2, 0, x2, N, t);
	while (x1 + 1 < x2)
	{
		int x = (x1 + x2) / 2;
		if (abs(d1 - d2) < EPS)
		{
			//db y1 = q(x1, 0, x1, N, t);
			//db y2 = q(x2, 0, x2, N, t);
			//if (abs(y1 - d1) > EPS || abs(y2 - d2) > EPS)
			//	while (true)
			//		cerr << "47";
			//if ((x1 + x2) & 1)
			//	ML();
			//assert(d1 > EPS && d2 > EPS);
			cerr << x1 << ' ' << x2 << ' ' << d1 << ' ' << d2 << '\n';
			assert((x1 + x2) % 2 == 0);
			return x;
		}
		if (d1 < d2)
		{
			x1 = x;
			d1 = q(x, 0, x, N, t);
		}
		else
		{
			x2 = x;
			d2 = q(x, 0, x, N, t);
		}
	}
	if (d1 > d2)
		return x1;
	else
		return x2;
}


int main()
{
	//ios::sync_with_stdio(0); 
	//cin.tie(0);
	//cout << fixed << setprecision(15);
	
	VI x = {0, 1};
	while (x.back() + d < N)
	{
		x.PB(x.back() + d);
	}
	x.PB(N - 1);
	vector<int> ans;
	FOR (t, 0, 1)
	{
		vector<db> res = {0};
		FOR (i, 1, SZ(x))
		{
			db pres = res.back();
			db p = q(x[i], 0, x[i], N, t);
			res.PB(p);
			if (pres > EPS && pres > p - EPS)
			{
				int j = i - 1;
				db prev = q(x[j] - 1, 0, x[j] - 1, N, t);
				if (prev > pres)
				{
					//assert(j != 0);
					ans.PB(f(x[j - 1], res[j - 1], x[j], res[j], t));
				}
				else
				{
					ans.PB(f(x[j], res[j], x[j + 1], res[j + 1], t));					
				}
				break;
			}
		}
	}
	
	db rad = q(ans[0], 0, ans[0], N, 0);
	int r = int(rad + EPS) / 2;
	int ly = r, ry = N - r + 1;
	while (ly + 1 < ry)
	{
		int y = (ly + ry) / 2;
		db an = q(ans[0], 0, ans[0], y, 0);
		if (2 * an <= rad + EPS)
			ly = y;
		else
			ry = y;
	}
	cout << "answer " << ans[0] << ' ' << ly << ' ' << r << endl;
	return 0;
}