#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <random>
#include <chrono>

using namespace std;
using i64 = long long;
using u64 = unsigned long long;

mt19937_64 rng {std::chrono::steady_clock::now().time_since_epoch().count()};

int tot = 0;

int q(int x, vector<int>& vis, int co, vector<int>& col) {
	int cnt = 1;
	for(int i = 1; i <= x; i++) 
		cnt += col[i] == co && !vis[i];
	if(cnt == 1)
		return -1;
	cout << "? " << cnt << " ";
	for(int i = 1; i <= x; i++)
		if(col[i] == co && !vis[i])
			cout << i << " ";
	cout << x << endl;
	int r1, r2;
	cin >> r1 >> r2;
	if(r1 == -1)
		return r1;
	return r1 + r2 - x;
}

void solve() {
	int n;
	cin >> n;
	vector<array<int, 2>> ans;
	vector<int> col(n + 1, 0);
	for(int i = 1; i <= n; i++) {
		vector<int> pos;
		vector<int> vis(n + 1, 0);
		for(int j = 1; j <= tot; j++) {
			int now = q(i, vis, j, col);
			if(now == -1)
				pos.push_back(j);
			while(now != -1) {
				vis[now] = 1;
				ans.push_back({now, i});
				now = q(i, vis, j, col);
			}
		} 
		if(!pos.size())
			col[i] = ++tot;
		else {
			col[i] = rng() % i64(pos.size());
		}
	}
	cout << "! " << ans.size() << endl;
	for(auto x : ans)
		cout << x[0] << ' ' << x[1] << endl; 
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
}