#include<bits/stdc++.h>
#define ll long long
using namespace std;
long long read(){
	long long x=0,f=1;char ch=getchar();
	while(!isdigit(ch))
	{if(ch=='-') f=-1;ch=getchar();}
	while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
void write(long long x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
const int N=4010;
int n;
int edge[N][N],sum;
vector<int>a,b,ep;
ll cnt=0;
vector<int>ask(vector<int>e){
	vector<int>g;
	printf("? %d",e.size());
	for(register auto x:e){
		putchar(' ');write(x);cnt++;
	}
	puts("");
	fflush(stdout);
	g.clear();
	for(register int i=0;i<e.size();i++){
		g.push_back(read());
	}
	return g;
}
vector<int>ask2(vector<int>a,vector<int>b){
	vector<int>c=a;
	for(auto x:b)c.push_back(x);
	vector<int>t=ask(c),d;d.clear();
	for(int i=0;i<b.size();i++){
		int x=t[i+a.size()];
		for(int j=0;j<i;j++)
			if(!t[j+a.size()])x-=edge[b[i]][b[j]];
		d.push_back(x);
	}
	return d;
}
void solve2(vector<int>s1,vector<int>s2,vector<int>s3){
	if(!s1.size()||!s2.size())return;
	if(s1.size()==1){
		for(int i=0;i<s2.size();i++){
			edge[s1[0]][s2[i]]=edge[s2[i]][s1[0]]=s3[i];
		}
		return;
	}
	int mid=(s1.size()-1)/2;
	vector<int>ls1,ls2,rs1,rs2,ls3,rs3,t;
	for(int i=0;i<=mid;i++)
		ls1.push_back(s1[i]);
	for(int i=mid+1;i<s1.size();i++)
		rs1.push_back(s1[i]);
	t=ask2(ls1,s2);
	for(int i=0;i<s2.size();i++){
		if(t[i]>0)
			ls2.push_back(s2[i]),ls3.push_back(t[i]);
		if(t[i]<s3[s1.size()+i])
			rs2.push_back(s2[i]),ls3.push_back(s3[i]-t[i]);
	}
	solve2(ls1,ls2,ls3);solve2(rs1,rs2,rs3);
}
void solve1(vector<int>s){
	if(s.size()<=1)return;
	vector<int>s1,s2;
	vector<int>t=ask(s);s1.clear();s2.clear();
	for(int i=0;i<s.size();i++){
		if(!t[i])s1.push_back(s[i]);
		else s2.push_back(s[i]);
	}
	solve1(s2);
	solve2(s1,s2,ask2(s1,s2));
}
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	n=read();
	for(register int i=1;i<=n;i++){
		for(register int j=1;j<=n;j++){
			edge[i][j]=-1;
		}
	}
	for(register int i=1;i<=n;i++){
		a.clear();a.push_back(i);
		a.push_back(i);
		b=ask(a);
		edge[i][i]=b[1];
	}
	a.clear();
	for(int i=1;i<=n;i++)a.push_back(i);
	solve1(a);
	for(register int i=1;i<=n;i++){
		for(register int j=i;j<=n;j++){
			if(edge[i][j]>0)sum+=edge[i][j];
		}
	}
	printf("! %d",sum);
	for(register int i=1;i<=n;i++){
		for(register int j=i;j<=n;j++){
			for(register int k=1;k<=edge[i][j];k++){
				putchar(' ');write(i);
				putchar(' ');write(j);
			}
		}
	}
	puts("");
	fflush(stdout);
	return 0;
}