#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<P>ans;
	auto question = [](int xl, int xr, int yl, int yr)->int {
		cout << "? " << xl << ' ' << xr - 1 << ' ' << yl << ' ' << yr - 1 << endl;
		int res;
		cin >> res;
		return res;
	};
	auto dfs = [&](auto&& self, int xl, int xr, int yl, int yr) ->void {
		if (!question(xl, xr, yl, yr)) return;
		if (xl + 1 == xr && yl + 1 == yr) {
			ans.emplace_back(xl, yl);
			return;
		}
		if (xr - xl > yr - yl) {
			int xm = (xl + xr) / 2;
			self(self, xl, xm, yl, yr);
			self(self, xm, xr, yl, yr);
		}
		else {
			int ym = (yl + yr) / 2;
			self(self, xl, xr, yl, ym);
			self(self, xl, xr, ym, yr);
		}
	};
	dfs(dfs, 0, 1000001, 0, 1000001);
	cout << "! " << ans.size() << endl;
	for (auto[x, y] : ans) cout << x << ' ' << y << endl;
	return 0;
}