#include <bits/stdc++.h>
using namespace std;
#define int long long

const double eps = 1e-10;

double query(int x_1, int y_1, int x_2, int y_2){
  cout << "query " << x_1 << ' ' << y_1 << ' ' << x_2 << ' ' << y_2 << ' ' << endl;
  double ret; cin >> ret;
  return ret;
}
void answer(int x, int y, int r){
  cout << "answer " << x << ' ' << y << ' ' << r << endl;
}
const int n = 1e5;
mt19937 rnd(2356);
int get_x(){
  queue<pair<int, int>> q;
  q.push({0, n});
  while(!q.empty()){
    auto [l, r] = q.front(); q.pop();
    double u; int m = l + r >> 1;
    if((u = query(m, 0, m, n)) > 0){
      while(l + 1 < r){
	m = l + r >> 1;
	double lval = query(l+m>>1, 0, l+m>>1, n),
	  rval = query(m+r>>1, 0, m+r>>1, n);
	if(lval - 0 < eps and rval - 0 < eps)
	  l = (l + m) >> 1, r = (r + m) >> 1;
	else if(abs(lval - rval) < eps) return m;
	else if(lval > rval) r = m;
	else l = m;
      } return l;
    }
    if(rnd()&1){
      q.push({l,m});
      q.push({m+1, r});
    }
    else{
      q.push({m+1, r});
      q.push({l,m});
    }
  }
}
int get_y(){
  queue<pair<int, int>> q;
  q.push({0, n});
  while(!q.empty()){
    auto [l, r] = q.front(); q.pop();
    double u; int m = l + r >> 1;
    if((u = query(0, m, n, m)) > 0){
      while(l + 1 < r){
	m = l + r >> 1;
	double lval = query(0, l+m>>1, n, l+m>>1),
	  rval = query(0, m+r>>1, n, m+r>>1);
	if(lval - 0 < eps and rval - 0 < eps)
	  l = (l + m) >> 1, r = (r + m) >> 1;
	else if(abs(lval - rval) < eps) return m;
	else if(lval > rval) r = m;
	else l = m;
      } return l;
    }
    if(rnd()&1){
      q.push({l,m});
      q.push({m+1, r});
    }
    else{
      q.push({m+1, r});
      q.push({l,m});
    }
  } 
}

signed main(){
  int x = get_x();
  int y = get_y();
  int ans = query(x, 0, x, n);
  answer(x, y, (int)(ans/2));
  return 0;
}