#include <bits/stdc++.h>
using namespace std;
#define name "code"
#define MAXN 100005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
void minimize(int &u, int v){
u=min(u,v);
}
void maximize(int &u, int v){
u=max(u,v);
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
int query(vector<int> &v){
cout<<(int)v.size()<<" ";
for (int x:v) cout<<x<<" ";
cout<<"\n";
fflush(stdout);
int response;
cin>>response;
return response;
}
vector<int> ask1;
vector<int> ask2;
int classes=0;
int c[MAXN];
int represent[MAXN];
int main()
{
srand(time(0));
int n;
cin>>n;
vector<int> root;
int prev=0;
FOR(i,1,n){
ask1.pb(i);
int cur=query(ask1);
if (prev!=cur){
root.pb(i);
represent[++classes]=i;
c[i]=classes;
}
else{
vector<int> tmp=root;
ask2.pb(i);
while (1){
if (tmp.size()==1){
c[i]=c[tmp.back()];
break;
}
int x=Rand(0,(int)tmp.size()-1);
ask2.pb(tmp[x]);
int u=query(ask2);
ask2.pop_back();
if (u==1){
c[i]=c[tmp[x]];
break;
}
FOR(j,x+1,(int)tmp.size()-1) swap(tmp[j],tmp[j-1]);
tmp.pop_back();
}
ask2.pop_back();
}
prev=cur;
}
cout<<0<<" ";
FOR(i,1,n) cout<<c[i]<<" ";
cout<<"\n";
fflush(stdout);
return 0;
}
