#include <iostream>
#include <vector>
#include <cmath>
#include <cassert>
using namespace std;
using ld = long double;

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x=0, T y=0) : x(x), y(y) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	ld dist() const { return sqrt((ld)dist2()); }
	// angle to x-axis in interval [-pi, pi]
	ld angle() const { return atan2(y, x); }
	P unit() const { return *this/dist(); } // makes dist()=1
	P perp() const { return P(-y, x); } // rotates +90 degrees
	P normal() const { return perp().unit(); }
	// returns point rotated 'a' radians ccw around the origin
	P rotate(ld a) const {
		return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
	friend ostream& operator<<(ostream& os, P p) {
		return os << "(" << p.x << "," << p.y << ")"; }
};

template<class P>
ld circleLine(P c, double r, P a, P b) {
	P ab = b - a, p = a + ab * (c-a).dot(ab) / ab.dist2();
	double s = a.cross(b, c), h2 = r*r - s*s / ab.dist2();
	if (h2 <= 0) return 0;
	return 2*sqrt(h2);
}

ld query(int a, int b, int c, int d) {
	if (a < 0 || b < 0 || c < 0 || d < 0) return 0.0;
	cout << "query " << a << ' ' << b << ' ' << c << ' ' << d << endl;
	ld val; cin >> val;
	//ld val = circleLine(Point<ld>(100.0, 100.0), 100.0, Point<ld>(a, b), Point<ld>(c, d));
	//cout << val << endl;
	return val;
}

int main() {
	const int bound = 1e5;
	int y = 0;
	for (; y <= bound; y += 199) {
		ld val = query(0, y, bound, y);
		if (val > 0.0) break;
	}
	for (int p = 1<<20; p > 0; p /= 2) {
		if (y-p < 0) continue;
		ld val = query(0, y-p, bound, y-p);
		if (val > 0) y -= p;
	}
	y--;
	ld a = query(0, y+1, bound, y+1);
	ld r = round((a*a/4+1)/2);
	ld b = query(0, y, bound, y+100);
	Point<ld> p1( 0.0l, (ld)y ), p2( (ld)bound, (ld)y+100 );
	int best = -1;
	ld bestDis = 1e9;
	for (int x = 0; x <= bound; x++) {
		ld val = circleLine(Point<ld>(x, y+r), r, p1, p2);
		if (abs(val-b) < bestDis) {
			bestDis=abs(val-b);
			best = x;
		}
	}
	cout << "answer " << best << ' ' << (int)round(y+r) << ' ' << (int)round(r) << endl;
}