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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); 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;

//#warning
const int N = 1e5;

db ask(int x0, int y0, int x1, int y1)
{
	cout << "query " << x0 << " " << y0 << " " << x1 << " " << y1 << endl;
	
	
	db res;
	cin >> res;
	return res;
}

const db eps = 1e-5;

int main()
{
	//ios::sync_with_stdio(0); 
	//cin.tie(0);
	//cout << fixed << setprecision(15);
	
	int x = 0;
	while(x < N)
	{
		db len = ask(x, 0, x, N);
		if(abs(len) > eps)
		{
			break;
		}
		
		//#warning
		//x += 1;
		x += 180;
	}
	int L = 0, R = x;
	while(R - L > 1)
	{
		int M = (L + R) / 2;
		db len = ask(M, 0, M, N);
		if(abs(len) > eps)
			R = M;
		else
			L = M;
	}
	
	int xL = L;
	
	L = xL + 1, R = N;
	while(R - L > 1)
	{
		int M = (L + R) / 2;
		db len = ask(M, 0, M, N);
		if(abs(len) > eps)
			L = M;
		else
			R = M;
	}
	int xR = R;
	int r = (xR - xL) / 2;
	int x0 = (xL + xR) / 2;
	
	L = 0, R = N;
	while(R - L > 1)
	{
		int M = (L + R) / 2;
		db len = ask(x0, 0, x0, M);
		if(abs(len) > eps)
			R = M;
		else
			L = M;
	}
	cout << "answer " << x0 << " " << L + r << " " << r << endl;
	
	
	
	
	
	
	
	
	
	return 0;
}