#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
inline int read()
{
	int s=0,w=1;char ch;
	while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
inline ll lread()
{
	ll s=0,w=1;char ch;
	while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
int e[4001][4001];
vc<int>S[4005];
vc<pi>ans;
int n,k;
inline vc<int> get(vc<int>S1,vc<int>S2)
{
	vc<int>ans;
	printf("? %d",(int)S1.size()+(int)S2.size());
	for(int i:S1) printf(" %d",i);
	for(int i:S2) printf(" %d",i);
	cout<<endl;

	for(unsigned i=0;i<S1.size();i++) assert(read()==0);
	for(unsigned i=0;i<S2.size();i++) ans.push_back(read());
	for(int i=(int)S2.size()-1;i>=0;i--) for(unsigned j=i+1;j<S2.size();j++) if(!ans[i]) ans[j]-=e[S2[i]][S2[j]];
	return ans;
}
void solve(int dep,int l,int r,vc<int>all,vc<int>cnt)
{
	assert(all.size()==cnt.size());
	if(l==r)
	{
		int p=S[dep][l];
		for(unsigned i=0;i<all.size();i++)
		{
			int q=all[i],c=cnt[i];
			e[p][q]=e[q][p]=c;
			for(int j=1;j<=c;j++) ans.push_back(pi(p,q));
		}
		return ;
	}
	int mid=(l+r)>>1;
	vc<int>all1,all2,cnt1,cnt2,L;
	for(int i=l;i<=mid;i++) L.push_back(S[dep][i]);
	vc<int>ans=get(L,all);
	//总共有cnt个,其中左边有ans个

	for(unsigned i=0;i<all.size();i++)
	{
		if(ans[i]) all1.push_back(all[i]),cnt1.push_back(ans[i]);
		if(cnt[i]-ans[i]) all2.push_back(all[i]),cnt2.push_back(cnt[i]-ans[i]);
	}
	solve(dep,l,mid,all1,cnt1);
	solve(dep,mid+1,r,all2,cnt2);
}
int main()
{
	n=read();vc<int>now;
	for(int i=1;i<=n;i++) now.push_back(i);
	while(now.size())
	{
		k++;vc<int>nx;
		printf("? %d",(int)now.size());
		for(int i:now) printf(" %d",i);
		cout<<endl;

		for(int i:now)
		{
			int A=read();
			if(!A) S[k].push_back(i);
			else nx.push_back(i);
		}
		now=nx;
	}

	// printf("k=%d\n",k);
	// for(int i=1;i<=k;i++)
	// {
	// 	for(int j:S[i]) printf("%d ",j);
	// 	putchar('\n');
	// }

	for(int i=k-1;i;i--)
	{
		//处理i层与>i层之间的连边
		vc<int>all;
		for(int j=i+1;j<=k;j++) for(int p:S[j]) all.push_back(p);
		solve(i,0,(int)S[i].size()-1,all,get(S[i],all));
	}

	for(int i=1;i<=n;i++)
	{
		printf("? 2 %d %d",i,i);cout<<endl;;read();
		int A=read();for(int j=1;j<=A;j++) ans.push_back(pi(i,i));
	}

	printf("! %d",(int)ans.size());
	for(auto i:ans) printf(" %d %d",i.first,i.second);
	cout<<endl;
	return 0;
}
/*
5
0 1 0 2 2
0 0 1
0
0 0 1
0 0
0 0 2 2 1
0 1 1 1
0 0
0 0
0 0
0 0
0 0
*/