#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()

template<typename A>
string to_string(A v) {
	string s = "{";
	for (auto x : v) {
		if (sz(s) > 1) s += ", ";
		s += to_string(x);
	}
	return s += "}";
}

void debug_out() { cerr << "\n"; }

template<typename T, typename... U>
void debug_out(const T& x, const U&... args) {
	cerr << " " << to_string(x);
	debug_out(args...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)  // Debugger

constexpr int N = 100000;
constexpr double eps = 1e-9;

int main() {
	auto Q = [&](int xl, int yl, int xr, int yr) {
		cout << "query " << xl << ' ' << yl << ' ' << xr << ' ' << yr << endl;
		double len;
		cin >> len;
		return len;
	};
	vector<pair<int, double>> px, py;
	for (int i = 1; i < N; i += 199) {
		auto len = Q(i, 0, i, N);
		if (len > eps) px.emplace_back(i, len); 
	} 
	for (int j = 1; j < N; j += 199) {
		auto len = Q(0, j, N, j);
		if (len > eps) py.emplace_back(j, len);
	}
	assert(sz(px) and sz(py));
	if (sz(px) == 1) {
		int i = px[0].first;
		auto len = Q(i + 99, 0, i + 99, N);
		if (len > eps) px.emplace_back(i + 99, len);
		else {
			len = Q(i - 99, 0, i - 99, N);
			assert(len > eps);
			px.emplace_back(i - 99, len);
			reverse(all(px));
		}
	}
	if (sz(py) == 1) {
		int j = py[0].first;
		auto len = Q(0, j + 99, N, j + 99);
		if (len > eps) py.emplace_back(j + 99, len);
		else {
			len = Q(0, j - 99, N, j - 99);
			assert(len > eps);
			py.emplace_back(j - 99, len);
			reverse(all(py));
		}
	}
	// vector<pair<int, double>> px = {make_pair(1, 2 * sqrt(3.)), make_pair(3, 2 * sqrt(3.))};
	// vector<pair<int, double>> py = {make_pair(1, 2 * sqrt(3.)), make_pair(3, 2 * sqrt(3.))};
	int x = -1, y = -1, r = -1;
	{
		double a = px[0].second / 2, b = px[1].second / 2, c = px[1].first - px[0].first;
		double tx = (b * b + c * c - a * a) / (2 * c);
		x = round(px[0].first + tx);
		r = round(sqrt(tx * tx + a * a));
	}
	{	
		double a = py[0].second / 2, b = py[1].second / 2, c = py[1].first - py[0].first;
		double ty = (b * b + c * c - a * a) / (2 * c);
		y = round(py[0].first + ty);
		int tr = round(sqrt(ty * ty + a * a));
		assert(tr == r);
	}
	cout << "answer " << x << ' ' << y << ' ' << r << endl;
}