#include <bits/stdc++.h>
using namespace std;
// #define endl "\n"
#define pb push_back
#define int long long
#define fi first
#define se second
const int N = 3e5 + 5, M = 1e9 + 7, LG = 20;
int n , A[N] , x , c;
int solve(){
cin >> n;
vector<int> di , qu , vl;
vl.pb(1);
int cr = 0;
for (int i=1 ; i<=n ; i++){
qu.pb(i);
cout << qu.size() << ' ';
for (int j : qu){
cout << j << ' ';
}
cout << endl;
cin >> x;
if (x == cr+1){
cr++;
vl.pb(i);
A[i] = cr;
}else{
int l=0 , r = vl.size();
while(l+1 < r){
int mid = (l+r)>>1;
cout << (mid-l+1) << ' ';
for (int j=l ; j<mid ; j++){
cout << vl[j] << ' ';
}
cout << i;
cout << endl;
cin >> x;
if (x == (mid-l+1)){
l = mid;
} else{
r = mid;
}
}
A[i] = A[vl[l]];
}
}
cout << 0 << ' ';
for (int i=1 ; i<=n ; i++){
cout << A[i] << ' ';
}
cout << endl;
return 0;
}
signed main(){
// freopen("" , "r" , stdin);
// freopen("" , "w" , stdout);
// cout << setprecision(30);
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int ts = 1;
// cin >> ts;
while(ts--){
solve();
}
}
