/*
	www.youtube.com/YugiHackerChannel
	oj.vnoi.info/user/YugiHackerKhongCopCode
*/
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn
#define double long double
#define int long long
using namespace std;

int N = 100000;
double xx = 45455, yy = 77886, rr = 224;
mt19937 rd(time(0));
long long Rand(long long l, long long r)
{
    return l + rd() % (r-l+1);
}
int cnt;
void solve()
{
    rr = Rand(100, 200);
    xx = Rand(rr, N - rr);
    yy = Rand(rr, N - rr);
    cnt = 0;
}

double dist(int x1, int y1, int x2, int y2)
{
    if (x1 == x2)
    {
        if (abs(xx - x1) >= rr) return 0;
        return sqrt(rr * rr - (xx - x1) * (xx - x1)) * 2;
    }
    else
    {
        if (abs(yy - y1) >= rr) return 0;
        return sqrt(rr * rr - (yy - y1) * (yy - y1)) * 2;
    }
}

double query(int x1, int y1, int x2, int y2)
{
    cnt++;
    cout << "query " << x1 << " " << y1 << " " << x2 << " " << y2 << endl;
    //double x = dist(x1, y1, x2, y2); cout << x << endl;
    double x; cin >> x;
    return x;
}

main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    while (t--)
    {
        solve();
    int lx = -1, rx = N;
    vector <double> asked_x(N+1, -1);
    auto ask_x = [&] (int x){
        if (asked_x[x] == -1) asked_x[x] = query(x, 0, x, N);
        return asked_x[x];
    };
    vector <double> v;
    v.push_back(0);
    vector <int> idx;
    idx.push_back(0);
    int jump = 199;
    for (int i=jump;; i+=jump)
    {
        if (i >= N) v.push_back(0), idx.push_back(N);
        else v.push_back(ask_x(i)), idx.push_back(i);
        if (v.size() > 2 && v.end()[-2] > 0 && v.back() <= v.end()[-2] && v.end()[-2] >= v.end()[-3])
        {
            lx = idx.end()[-3], rx = idx.end()[-1];
            break;
        }
        if (i >= N) break;
    }
    assert(lx != -1);
    while (rx - lx > 2)
    {
        int m1 = (lx + rx) / 2;
        int m2 = m1 + 1;
        double p1 = ask_x(m1);
        double p2 = ask_x(m2);
        if (p1 < p2) lx = m1;
        else rx = m2;
    }
    int X = lx + 1;
    long long R = (ask_x(X) / 2 + 0.5);
    vector <double> asked_y(N+1, -1);
    auto ask_y = [&] (int x){
        if (asked_y[x] == -1) asked_y[x] = query(0, x, N, x);
        return asked_y[x];
    };
    int Y = -1;
    for (int i=jump;; i+=jump)
    {
        double tmp = ask_y(i) / 2;
        if (ask_y(i) > 0)
        {
            long long d = sqrt(R * R - tmp * tmp) + 0.5;
            if (i + d + R <= N && ask_y(i+d) == R*2) Y = i + d;
            else if (i - d >= R) Y = i - d;
            break;
        }
    }
    cerr << xx << ' ' << yy << ' ' << rr << endl;
    cout << "answer " << X << " " << Y << " " << R << endl;
    //assert(xx == X && yy == Y && rr == R);
    assert(cnt <= 1024);
    }
}