#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

struct B {
  int xl, xr, yl, yr, k;
  B() = default;
  B(int xl, int xr, int yl, int yr, int k) : xl(xl), xr(xr), yl(yl), yr(yr), k(k) {}
};

int output(int xl, int xr, int yl, int yr) {
  cout << "? " << xl << " " << xr-1 << " " << yl << " " << yr-1 << endl;
  int ret;
  cin >> ret;
  return ret;
}

int main() {
  queue<B> que;
  que.emplace(0, 1000001, 0, 1000001, 0);
  vector<P> ans;
  while(!que.empty()) {
    B b = que.front();
    que.pop();
    if (b.xr == b.xl+1) {
      if (b.yr == b.yl+1) {
        ans.eb(b.xl, b.yl);
        continue;
      } else {
        if (b.k % 2 == 0) {
          ++b.k;
          que.emplace(b);
          continue;
        }
      }
    } else if (b.yr == b.yl+1) {
      if (b.k % 2 == 1) {
        ++b.k;
        que.emplace(b);
        continue;
      }
    }
    if (b.k % 2 == 0) {
      int mx = (b.xl+b.xr)/2;
      if (output(b.xl, mx, b.yl, b.yr)) {
        que.emplace(b.xl, mx, b.yl, b.yr, b.k+1);
      }
      if (output(mx, b.xr, b.yl, b.yr)) {
        que.emplace(mx, b.xr, b.yl, b.yr, b.k+1);
      }
    } else {
      int my = (b.yl+b.yr)/2;
      if (output(b.xl, b.xr, b.yl, my)) {
        que.emplace(b.xl, b.xr, b.yl, my, b.k+1);
      }
      if (output(b.xl, b.xr, my, b.yr)) {
        que.emplace(b.xl, b.xr, my, b.yr, b.k+1);
      }
    }
  }
  cout << "! " << len(ans) << endl;
  for (auto [x, y] : ans) {
    cout << x << " " << y << endl;
  }
  return 0;
}