#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
const int mod=998244353;
typedef long long ll;
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second

void add(int &x,int y){x=(x+y>=mod)?(x+y-mod):x+y;}
int qpow(int x,int y){int ret=1;while(y){if(y&1)ret=1ll*ret*x%mod;x=1ll*x*x%mod;y>>=1;}return ret;}
const int N=2005;
int n,k,col[N],cnt,vis[N],tot;
vector<int>f[N],e[N];//f[i] is a independent set

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	cin>>n;k=1;
	rep(i,1,n)f[1].pb(i),col[i]=1;
	while(1){
		int i,j;
		if(f[k].size()>1){
			printf("? %d ",f[k].size());
			for(auto x:f[k])printf("%d ",x);puts("");fflush(stdout);
			cin>>i>>j;
		}
		else{
			i=-1;j=-1;
		}
		if(i==-1&&j==-1){
			for(auto x:f[k])++cnt;
			if(cnt==n)break;
			k++;
		} 
		else{
			++tot;
			e[i].pb(j);
			e[j].pb(i);
			rep(t,1,n){
				memset(vis,0,sizeof(vis));
				if(col[t]<k)continue;
				for(auto u:e[t])if(u<t){
					vis[col[u]]=1;
				}
				int col=k;while(vis[col])col++;
				::col[t]=col; 
			}
			rep(t,k,n)f[t].clear();
			rep(t,1,n)if(col[t]>=k)f[col[t]].pb(t);
		}
		//printf("Current coloring:\n");
		//rep(i,1,n){
		//	for(auto x:f[i])printf("%d ",x);puts("");
		//}
	}
	rep(i,1,k)rep(j,i+1,k){
		bool flg=0;
		if(f[i].size()>f[j].size())flg=1,swap(f[i],f[j]);
		for(auto x:f[i]){
			set<int>u;
			for(auto y:f[j])u.insert(y);
			for(auto y:e[x])u.erase(y);
			while(1){
				if(u.size()==0)break;
				printf("? %d ",u.size()+1);
				printf("%d ",x);
				for(auto v:u)printf("%d ",v);puts("");fflush(stdout);
				int ii,jj;
				cin>>ii>>jj;
				if(ii==-1)break;
				if(jj==x)swap(ii,jj);
				u.erase(jj);
				e[ii].pb(jj);e[jj].pb(ii); 
				++tot;
			}
		}
		if(flg)swap(f[i],f[j]);
	}
	printf("! %d\n",tot);
	rep(i,1,n)for(auto x:e[i])if(x<i)printf("%d %d\n",i,x);
	return 0;
}