#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i, a, b) for(int i = a; i <= b; i ++)
#define REP(i, a, b) for(int i = a; i >= b; i --)
#define pb push_back
#define fr first
#define sd second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 4010
int n, m;
int S = 0, cnt[N];
vector<pair<int, int>>ans;
vector<int> ask(vector<int>a)
{
	if (a.empty())return {};
	S += a.size(); //assert(S <= 176000);
	cout << "? " << a.size() << ' ';
	for (int x : a)cout << x << ' '; cout << endl;
	vector<int>b;
	for (int x : a) {int t; cin >> t; b.push_back(t);}
	return b;
}
void calc(const vector<int>a, int l, int r, vector<int>b)
{
	if (b.empty())return ;
	vector<int>tmp;
	FOR(i, l, r)tmp.push_back(a[i]);
	for (int x : b)tmp.push_back(x);
	vector<int>G = ask(tmp); int m = b.size();
	vector<int>nb;
	if (l == r)
	{
		FOR(i, 0, m - 1)
		{
			int x = a[l], y = b[i];
			if (x <= y)while (G[i + 1] --)ans.push_back({x, y});
		}
		return ;
	}
	else
	{
		FOR(i, 0, m - 1)if (G[i + (r - l + 1)])nb.push_back(b[i]);
	}
	int mid = (l + r) >> 1;
	calc(a, l, mid, nb); calc(a, mid + 1, r, nb);
}
void sol(vector<int>c)
{
	if (c.empty())return ;
	vector<int>tmp = ask(c);
	vector<int>X, Y;
	int m = c.size();
	FOR(i, 0, m - 1)if (!tmp[i])X.push_back(c[i]); else Y.push_back(c[i]);
	int k = X.size();
	calc(X, 0, k - 1, c);
	sol(Y);
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	vector<int>a(n);
	FOR(i, 0, n - 1)a[i] = i + 1;
	sol(a);
	cout << "!" << ' ';
	cout << ans.size() << ' ';
	for (auto [x, y] : ans)cout << x << ' ' << y << ' '; cout << endl;
	return 0;
}
/*
6
4 6 8 9 2 4
*/