#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)printf(" %d",x),cnt++;
	puts("");
	fflush(stdout);
	g.clear();
	for(register int i=0;i<e.size();i++){
		g.push_back(read());
	}
	return g;
}
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];
	}
	for(register int i=1;i<n;i++){
		int lst=i;
		while(1){
			a.clear();a.push_back(i);
			for(register int j=lst+1;j<=n;j++){
				if(edge[i][j]==-1){
					a.push_back(j);
				}
			}
			if(a.size()==1)break;
			b=ask(a);
			ep.clear();ep.push_back(i);
			for(register int j=1;j<a.size();j++){
				if(!b[j]){
					for(register auto x:ep)edge[a[j]][x]=edge[x][a[j]]=0;
					ep.push_back(a[j]);
				}
				else if(ep.size()==1){
					edge[i][a[j]]=edge[a[j]][i]=b[j];
				}
			}
			if(ep.size()>1)lst=ep[1];
			if(cnt>176000)return 0;
		}
	}
	for(register int i=1;i<=n;i++){
		for(register int j=i;j<=n;j++){
			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++)
				printf(" %d %d",i,j);
		}
	}
	puts("");
	fflush(stdout);
	return 0;
}