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

typedef long double db;
typedef long long ll;
const db eps=1e-6;

db ask(ll x1,ll y1,ll x2,ll y2){
	cout << "query " << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
	db res=0;
	cin >> res;
	return res;
}

void answer(ll x,ll y,ll r){
	cout << "answer " << x << " " << y << " " << r << endl;
}

pair<ll,ll> gao(pair<ll,db> A,pair<ll,db> B,pair<ll,db> C){
	db k1=2*(B.first-A.first);
	db b1=A.first*A.first-B.first*B.first+A.second*A.second/4-B.second*B.second/4;
	db k2=2*(C.first-A.first);
	db b2=A.first*A.first-C.first*C.first+A.second*A.second/4-C.second*C.second/4;
	
	db _x=(b2-b1)/(k1-k2);
	db _R=sqrt((_x-A.first)*(_x-A.first)+A.second*A.second/4);
	ll x=(ll)floor(_x+0.5);
	ll R=(ll)floor(_R+0.5);
	return make_pair(x,R);
}

const ll maxn=100000;
const ll B=199;

pair<ll,ll> solve(ll op){
	vector<pair<ll,db>> v;
	ll pos=-1;
	for (ll i=0;i<=maxn;i+=B){
		db res=0;
		if (op==0) res=ask(i,0,i,maxn);
		else res=ask(0,i,maxn,i);
		if (abs(res)>eps){
			pos=i;
			break;
		}
	}
	if (pos==-1){
		ll i=maxn;
		db res=0;
		if (op==0) res=ask(i,0,i,maxn);
		else res=ask(0,i,maxn,i);
		if (abs(res)>eps){
			pos=i;
		}
	}
	for (ll i=pos-2;i<=pos+2;i++){
		db res=0;
		if (op==0) res=ask(i,0,i,maxn);
		else res=ask(0,i,maxn,i);
		if (abs(res)>eps){
			v.emplace_back(i,res);
		}
	}
	assert(v.size()>=3);
	return gao(v[0],v[1],v[2]);
}

int main(){
	ios_base::sync_with_stdio(false);
	
	pair<ll,ll> tmpx = solve(0);
	pair<ll,ll> tmpy = solve(1);
	answer(tmpx.first,tmpy.first,tmpx.second);
	return 0;
}