#include <bits/stdc++.h>
#include <unordered_map>
#include <stdlib.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

using mint = modint998244353;

ll gcd(ll a, ll b){
    if(a%b == 0){
      return b;
    }else{
      return gcd(b, a%b);
    }
}

ll lcm(ll a, ll b){
    return a*b / gcd(a, b);
}

ll powMod(ll x, ll n) {
    if (n == 0) return 1 % MOD;
    ll val = powMod(x, n / 2);
    val *= val;
    val %= MOD;
    if (n % 2 == 1) val *= x;
    return val % MOD;
}

int main() {
    vector<pll> vec;
    auto solve = [&](auto solve, ll l, ll r, ll u, ll d) -> void {
        if(l == r && u == d){
            vec.push_back({l,u});
            return;
        }
        if(l < r){
            ll mid = (l+r)/2;
            cout << "? " << l << " " << mid << " " << u << " " << d << endl;
            ll x; cin >> x;
            if(x) solve(solve,l,mid,u,d);
            cout << "? " << mid+1 << " " << r << " " << u << " " << d << endl;
            ll y; cin >> y;
            if(y) solve(solve,mid+1,r,u,d); 
        }else{
            ll mid = (u+d)/2;
            cout << "? " << l << " " << r << " " << u << " " << mid << endl;
            ll x; cin >> x;
            if(x) solve(solve,l,r,u,mid);
            cout << "? " << l << " " << r << " " << mid+1 << " " << d << endl;
            ll y; cin >> y;
            if(y) solve(solve,l,r,mid+1,d); 
        }
    };
    solve(solve,0,1000000,0,1000000);
    cout << "! " << vec.size() << endl;
    for(auto [x,y] : vec) cout << x << " " << y << endl;
    return 0;
}