#include <cmath>
#include <tuple>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

const bool DEBUG = false; // TODO: MAKE IT FALSE
const int AX = 12345;
const int AY = 98765;
const int AR = 234;

long double ask(int xa, int ya, int xb, int yb, int f) {
    if (f == 1) {
        swap(xa, ya);
        swap(xb, yb);
    }
    cout << "query " << xa << ' ' << ya << ' ' << xb << ' ' << yb << endl;
    if (DEBUG) {
        if (ya == yb) {
            int d = abs(ya - AY);
            if (d >= AR) {
                return 0.0;
            }
            double l = AX - sqrt(AR * AR - d * d);
            double r = AX + sqrt(AR * AR - d * d);
            return max(min(1.0 * xb, r) - max(1.0 * xa, l), 0.0);
        } else {
            int d = abs(xa - AX);
            if (d >= AR) {
                return 0.0;
            }
            double l = AY - sqrt(AR * AR - d * d);
            double r = AY + sqrt(AR * AR - d * d);
            return max(min(1.0 * yb, r) - max(1.0 * ya, l), 0.0);
        }
    }
    long double res;
    cin >> res;
    return res;
}

pair<int, int> finder(int f) {
    pair<int, long double> result1;
    for (int i = 199; i < 100000; i += 199) {
        long double res = ask(i, 0, i, 100000, f);
        if (res > 0.0) {
            result1 = make_pair(i, res);
            break;
        }
    }
    long double res2 = ask(result1.first - 1, 0, result1.first - 1, 100000, f);
    tuple<int, long double, long double> result2;
    if (res2 > 0.0) {
        result2 = {result1.first - 1, res2, result1.second};
    } else {
        long double res3 = ask(result1.first + 1, 0, result1.first + 1, 100000, f);
        result2 = {result1.first, result1.second, res3};
    }
    long double Z = (get<2>(result2) * get<2>(result2) / 4 - get<1>(result2) * get<1>(result2) / 4 + 1) / 2;
    int X = round(get<0>(result2) + Z);
    int R = round(sqrt(get<1>(result2) * get<1>(result2) / 4 + Z * Z));
    return {X, R};
}

int main() {
    pair<int, int> res1 = finder(0);
    pair<int, int> res2 = finder(1);
    cout << "answer " << res1.first << ' ' << res2.first << ' ' << res1.second << endl;
    return 0;
}