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

using ll = long long;
using LL = long long;
using pii = pair<int, int>;

int n;
vector<int> v;
vector<vector<int>> IS;
vector<int> edge[4005];
int asked;

vector<int> ask(vector<int> &v) {
	asked += (int)v.size();
	if (asked > 176000) {
        while (true) {
            asked++;
        }
	}
	cout << "? " << (int)v.size();
	for (auto i : v) {
		cout << " " << i;
	}
	cout << "\n";
	cout.flush();
	vector<int> ans;
	for (int i = 0; i < v.size(); i++) {
		int tmp;
		cin >> tmp;
		ans.push_back(tmp);
	}
	return ans;
}
vector<int> E;
vector<int> f(vector<int> &s1, vector<int> &s2) {
    // cout << "at s1=";
    // for (auto i : s1) {
    //     cout << i <<" ";
    // }
    // cout << " s2=";
    // for (auto i : s2) {
    //     cout << i << " ";
    // }
    // cout << endl;
	if (!s1.size() || !s2.size()) return E;
	vector<int> tmp;
	for (auto i : s2) {
		tmp.push_back(i);
	}
	for (auto i : s1) {
		tmp.push_back(i);
	}
	auto ans = ask(tmp);
	if (s2.size() == 1) {
        // cout << "  s2.size()== 1" << endl;
		for (int i = 0; i < s1.size(); i++) {
			int num = ans[i + 1];
			for (int j = 1; j <= num; j++) {
				edge[s1[i]].push_back(s2[0]);
			}
		}
        // cout << "  leave" << endl;
        vector<int> cnts;
        for (int i = 1; i < ans.size(); i++) {
            cnts.push_back(ans[i]);
        }
		return cnts;
	}
	int p = 0;
	vector<int> nonzero;
    vector<int> cnts;
	for (int i = s2.size(); i < s2.size() + s1.size(); i++) {
		int cnt = ans[i];
		int id = s1[p];
		if (cnt != 0) {
			nonzero.push_back(id);
		}
		cnts.push_back(cnt);
		p++;
	}
	vector<int> h1, h2;
	for (int i = 0; i < s2.size(); i++) {
		if (i < s2.size() / 2) h1.push_back(s2[i]);
		else h2.push_back(s2[i]);
	}
	vector<int> cnts1;
    // cout << "nonzero: ";
    // for (auto i : nonzero) {
    //     cout << i << " ";
    // }
    // cout << endl;
	cnts1 = f(nonzero, h1);
	vector<int> nonzero2;
	int pp = 0;
	for (int i = 0; i < nonzero.size(); i++) {
        // cout << "at " << i << ", nonzero[i]=" << nonzero[i] << endl;
		while (s1[pp] != nonzero[i]) pp++;
        // cout << "pp=" << pp << ", s1[pp]=" << s1[pp] << ", cnts[pp]=" << cnts[pp] << endl;
		if (cnts[pp] != cnts1[i]) {
            // cout << cnts[pp] << " != " << cnts1[i] << ", pushback " << nonzero[i] << endl;
            nonzero2.push_back(nonzero[i]);
        }
	}
    // cout << "nonzero2: ";
    // for (auto i : nonzero2) {
    //     cout << i << " ";
    // }
    // cout << endl;
	f(nonzero2, h2);
    return cnts;
}

void solve(int TC) {
	cin >> n;
	asked = 0;
	for (int i = 1; i <= n; i++) {
		v.push_back(i);
	}
	while (v.size() > 1) {
		auto ans = ask(v);
		vector<int> v2, s;
		for (int i = 0; i < v.size(); i++) {
			if (ans[i] == 0) s.push_back(v[i]);
			else v2.push_back(v[i]);
		}
		v = v2;
		IS.push_back(s);
	}
	if (v.size() == 1) {
		IS.push_back(v);
		v.clear();
	}
	for (int i = 0; i < IS.size(); i++) {
		for (int j = i + 1; j < IS.size(); j++) {
			vector<int> cnt;
            // cout << "start IS=";
            // for (auto k : IS[i]) cout << k << " ";
            // cout << " and IS=";
            // for (auto k : IS[j]) cout << k << " ";
            // cout << endl;
			f(IS[i], IS[j]);
		}
	}
	for (int i = 1; i <= n; i++) {
		vector<int> tmp;
		tmp.push_back(i);
		tmp.push_back(i);
		auto ans = ask(tmp);
		int num = ans[1];
		for (int j = 1; j <= num; j++) {
			edge[i].push_back(i);
		}
	}
	int total = 0;
	for (int i = 1; i <= n; i++) {
		total += edge[i].size();
	}
	cout << "! " << total;
	for (int i = 1; i <= n; i++) {
		for (auto j : edge[i]) {
			cout << " " << i << " " << j;
		}
	}
	cout << "\n";
	cout.flush();
	return;
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);

	int t = 1;
	// cin >> t;

	for (int i = 1; i <= t; i++) {
		solve(i);
	}
}