#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() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<P>v;
	auto query = [&](int i, int l, int r) {
		cout << "? " << 1 << " " << r - l << " " << i + 1 << " ";
		rep2(i, l, r)cout << i + 1 << " ";
		int x; cin >> x;
		return x;
	};
	auto check = [&](int i, int l, int r) {
		if (r - l <= 0)return false;
		auto x = query(i, l, r);
		return x != 0;
	};
	rep(i, n - 1) {
		int l = i + 1, r = n;
		while (check(i, l, r)) {
			int L = l, R = r;
			while (R - L != 1) {
				int M = (L + R) / 2;
				if (check(i, L, M)) {
					R = M;
				}
				else {
					L = M;
				}
			}
			v.emplace_back(i, L);
			l = L + 1;
		}
	}
	cout << "! " << v.size() << endl;
	for (auto [p, q] : v)cout << p + 1 << " " << q + 1 << endl;
	return 0;
}