#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
ld query(int x1, int y1, int x2, int y2)
{
    cout<<"query "<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl;
    ld res; cin>>res;
    return res;
}
int main()
{
    int n = 100000;
    int y = -1;
    for (int i = 150; ; i += 150)
    {
        assert(i <= n);
        ld res = query(0, i, n, i);
		
		if(res > 1e-8){
			y = i;
			int tmp = y;
			for(int k=-10;k<=10;k++){
				if(y+k < 0 || y+k > n)continue;
					y = tmp+k;
					res = query(0,y,n,y);
					if(res - 1 > 1e-8){
						break;
					}

			}
			break;
		}
    }
	int Lx = 1, Rx = n;
	while(Rx >= Lx){
        int mid = (Lx + Rx) / 2;
		ld res = query(0,y,mid,y);
        if(res < 1e-8)Lx = mid+1;
		else Rx = mid-1;
	}

	int Ly = 1, Ry = n;
	while(Ry >= Ly){
        int mid = (Ly + Ry) / 2;
		ld res = query(Lx,0,Lx,mid);
        if (res < 1e-8)Ly = mid+1;
		else Ry = mid-1;
	}

	ld interx = Lx;
	ld intery = Ly;

	interx -= query(0,y,Lx,y);
	intery -= query(Lx,0,Lx,Ly);

	pair<ld,ld>center;
	center.fi = round(interx + query(0,y,n,y)/2);
	center.se = round(intery + query(Lx,0,Lx,n)/2);

	int centerx = center.fi;
	int centery = center.se;
	int radius = round(query(0,0,centerx,centery));

    cout<<"answer "<<centerx<<" "<<centery<<" "<<radius<<'\n';
}