#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define FOR(i, x, n) for(int i = x; i < n; i++)
#define F0R(i, n) FOR(i, 0, n)
#define ROF(i, x, n) for(int i = n - 1; i >= x; i--)
#define R0F(i, n) ROF(i, 0, n)

#define WTF cout << "WTF" << endl

#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define F first
#define S second
#define PB push_back
#define EP emplace_back

#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()

using namespace std;

typedef long long LL;
typedef long double LD;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;

typedef complex<LD> Point;

const int N = 2e5 + 7;
const int INF = 1e9 + 7;
const int LOG = 22;
const int A = 26;
const int SQ = 320;
const int MOD = 1e9 + 7;
const int MX = 1e5;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

double ask(char jah, int p) {
    if (jah == 'V') 
        cout << "query " << p << ' ' << 0 << ' ' << p << ' ' << MX << endl;
    else
        cout << "query " << 0 << ' ' << p << ' ' << MX << ' ' << p << endl;
    cout << flush;
    double x; cin >> x;
    return x;
}

int main() {
    VI asks;
    asks.PB(199);
    while(asks.back() + 199 < MX) 
        asks.PB(asks.back() + 199);
    shuffle(ALL(asks), rng);

    int ansx = 0, ansy = 0;

    int got = 0;
    for(int on : asks) {
        if (ask('V', on)) {
            got = on;
            break;
        }
    }

    int l = got, r = MX;
    while(l < r) {
        int mid = (l + r) >> 1;
        if (ask('V', mid)) l = mid + 1;
        else r = mid;
    }
    int rgt = l;

    l = 0, r = got;
    while(l < r) {
        int mid = (l + r) >> 1;
        if (ask('V', mid)) r = mid;
        else l = mid + 1;
    }
    int lft = l - 1;
    
    int ansr = (rgt - lft) / 2;
    ansx = (rgt + lft) / 2;

    got = 0;
    for(int on : asks) {
        if (ask('H', on)) {
            got = on;
            break;
        }
    }

    l = got, r = MX;
    while(l < r) {
        int mid = (l + r) >> 1;
        if (ask('H', mid)) l = mid + 1;
        else r = mid;
    }
    int up = l;

    l = 0, r = got;
    while(l < r) {
        int mid = (l + r) >> 1;
        if (ask('H', mid)) r = mid;
        else l = mid + 1;
    }
    int dn = l - 1;
    
    ansy = (up + dn) / 2;

    cout << "answer " << ansx << ' ' << ansy << ' ' << ansr << endl;
    cout << flush;

    return 0;
}