#include <bits/stdc++.h>

#define int long long
#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

const int debug = 0, X = 50000, Y = 50000, R = 50000;

int sum;

inline double get(int x, int y, int xx, int yy) {
    if (x == xx) return (fabs(X - x) > R ? 0 : sqrt((double)R * R - (X - x) * (X - x)) * 2);
    else return (fabs(Y - y) > R ? 0 : sqrt((double)R * R - (Y - y) * (Y - y)) * 2);
}

inline double ask1(int x) {
    ++sum;
    if (!debug) cout << "query " << x << " 0 " << x << " 100000 " << endl;
    double res = 0; if (!debug) cin >> res; else res = get(x, 0, x, 10000); return res;
}

inline double ask2(int x) {
    ++sum;
    if (!debug) cout << "query 0 " << x << " 100000 " << x << endl;
    double res = 0; if (!debug) cin >> res; else res = get(0, x, 10000, x); return res;
}

signed main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int pos = 100, x = 0, y = 0;
    double mx1 = 0, mx2 = 0;
    while (pos < 100000) {
        double now1 = ask1(pos), now2 = ask2(pos);
        if (now1 > mx1) x = pos, mx1 = now1;
        if (now2 > mx2) y = pos, mx2 = now2;
        pos += 199;
    }
    double mx11 = ask1(x - 1), mx12 = ask1(x + 1);
    int xx = x;
    if (mx11 == 0) mx11 = mx12, xx = x + 1;
    else xx = x - 1;
    double mx21 = ask2(y - 1), mx22 = ask2(y + 1);
    int yy = y;
    if (mx21 == 0) mx21 = mx22, yy = y + 1;
    else yy = y - 1;
    double ans = 100000;
    int ansi = 100;
    F(i, 100, 50000) {
        if ((double)i * i < (mx1 / 2.0) * (mx1 / 2.0)) continue;
        if ((double)i * i < (mx11 / 2.0) * (mx11 / 2.0)) continue;
        if (fabs(fabs(sqrt(i * i - (mx1 / 2.0) * (mx1 / 2.0)) - sqrt(i * i - (mx11 / 2.0) * (mx11 / 2.0))) - 1) < ans) {
            ansi = i;
            ans = fabs(fabs(sqrt(i * i - (mx1 / 2.0) * (mx1 / 2.0)) - sqrt(i * i - (mx11 / 2.0) * (mx11 / 2.0))) - 1);
        }
    }
    ans = 100000;
    int ansx = x, ansy = y;
    F(i, max(0LL, x - 200), min(100000LL, x + 200))
        F(j, max(0LL, y - 200), min(100000LL, y + 200)) {
            if (fabs((i - x) * (i - x) + (mx1 / 2.0) * (mx1 / 2.0) - ansi * ansi) + fabs((j - y) * (j - y) + (mx2 / 2.0) * (mx2 / 2.0) - ansi * ansi) + fabs((i - xx) * (i - xx) + (mx11 / 2.0) * (mx11 / 2.0) - ansi * ansi) + fabs((j - yy) * (j - yy) + (mx21 / 2.0) * (mx21 / 2.0) - ansi * ansi) < ans) {
                ansx = i;
                ansy = j;
                ans = fabs((i - x) * (i - x) + (mx1 / 2.0) * (mx1 / 2.0) - ansi * ansi) + fabs((j - y) * (j - y) + (mx2 / 2.0) * (mx2 / 2.0) - ansi * ansi) + fabs((i - xx) * (i - xx) + (mx11 / 2.0) * (mx11 / 2.0) - ansi * ansi)+ fabs((j - yy) * (j - yy) + (mx21 / 2.0) * (mx21 / 2.0) - ansi * ansi);
            }
        }
    cerr << sum << endl;
    cout << "answer " << ansx << " " << ansy << " " << ansi << endl;
    return 0;
}