#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;
int a[N],b[N],e[N],ta,tb,te;
ll cnt=0;
void ask(){
tb=0;
printf("? %d",ta);
for(int i=0;i<ta;i++){
putchar(' ');write(a[i]);cnt++;
}
if(cnt>176000){
puts("0");exit(0);)
puts("");
fflush(stdout);
for(register int i=0;i<ta;i++){
b[tb++]=read();
}
}
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
n=read();
double st=clock();
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++){
ta=0;a[ta++]=i;a[ta++]=i;
ask();
edge[i][i]=b[1];
}
for(register int i=1;i<n;i++){
int lst=i;
while(1){
ta=0;a[ta++]=i;
for(register int j=lst+1;j<=n;j++){
if(edge[i][j]==-1){
a[ta++]=j;
}
}
if(ta==1)break;
ask();
te=0;e[te++]=i;
for(register int j=1;j<ta;j++){
if(!b[j]){
for(int k=0;k<te;k++)edge[a[j]][e[k]]=edge[e[k]][a[j]]=0;
e[te++]=a[j];
}
else if(te==1){
edge[i][a[j]]=edge[a[j]][i]=b[j];
}
}
if(te>1)lst=e[1];
//if(cnt>166000){
// double ed=clock();
// printf("ti=%.3lf\n",ed-st);
// 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++){
putchar(' ');write(i);
putchar(' ');write(j);
}
}
}
puts("");
fflush(stdout);
return 0;
}