#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 2e5 + 5;
vi rep(mxn);
int ask(vi v){
cout<<v.size()<<' ';
for(auto u : v)cout<<u+1<<' ';
cout<<endl;
int x;
cin>>x;
return x;
}
int cnt = 0;
int solve(int l, int r, int y){
// cout<<"solving "<<l<<' '<<r<<' '<<y<<'\n';
if(l == r){
return l;
}
else{
int mid = (l + r) / 2;
vi cur;
for(int i = l; i<=mid; i++){
cur.pb(rep[i]);
}
cur.pb(y);
int x = ask(cur);
if(x == cur.size() - 1){
return solve(l, mid, y);
}
else{
return solve(mid + 1, r, y);
}
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
in(n);
vi ans(n,-1);
ans[0] = 0;
cnt++;
rep[0] = 0;
FOR(i, 1, n){
vi cur;
f0r(j, cnt){
cur.pb(rep[j]);
}
cur.pb(i);
int x = ask(cur);
if(x == cur.size()){
ans[i] = cnt;
rep[cnt] = i;
//cout<<"REP"<<' '<<cnt<<' '<<i<<'\n';
cnt++;
}
else{
int col = solve(0, cnt-1, i);
ans[i] = col;
}
}
//f0r(i,3)cout<<rep[i]<<' ';
//cout<<'\n';
cout<<0<<' ';
f0r(i,n){
cout<<ans[i] + 1<<' ';
}
cout<<endl;
}
