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

vector<pair<int, int>> presents;

bool ask(int l, int r, int d, int u){
    cout << "? " << l << " " << r << " " << d << " " << u << endl;
    int res;
    cin >> res;
    assert(res != -1);
    return res;
}

void dfs(int l, int r, int d, int u){
    if(l == r){
        if(d == u){
            presents.emplace_back(make_pair(l, d));
        }
        else{
            int m = (d + u) / 2;
            if(ask(l, r, d, m)) dfs(l, r, d, m);
            if(ask(l, r, m + 1, u)) dfs(l, r, m + 1, u);
        }
    }
    else{
        int m = (l + r) / 2;
        if(ask(l, m, d, u)) dfs(l, m, d, u);
        if(ask(m + 1, r, d, u)) dfs(m + 1, r, d, u);
    }
}

int main(){
    dfs(0, 1'000'000, 0, 1'000'000);
    cout << "! " << presents.size() << endl;
    for(auto [x,y]:presents){
        cout << x << " " << y << endl;
    }
    return 0;
}