/*
* Author: Nonoze
* Created: Thursday 11/12/2025
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;
void solve();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt=1;
// cin >> tt;
while(tt--) solve();
return 0;
}
int query(vector<int> &a) {
cout << sz(a) << ' ';
for (auto x : a) cout << x+1 << ' ';
cout << endl << flush;
int res; cin >> res;
return res;
}
int n, k, m, q;
vector<int> a;
void solve() {
read(n);
vector<int> a(1, 0), b;
vector<int> ans(n, -1); ans[0]=1;
for (int i=1; i<n; i++) {
a.pb(i);
if (query(a)!=sz(a)) a.pop_back(), b.pb(i);
ans[a.back()]=sz(a);
}
for (auto &u: b) {
int l=0, r=sz(a)-1, res=0;
while (l<=r) {
int mid=(l+r)/2;
vector<int> c(1, u);
for (int i=0; i<=mid; i++) c.pb(a[i]);
if (query(c)!=sz(c)) res=mid, r=mid-1;
else l=mid+1;
}
ans[u]=ans[a[res]];
}
cout << 0 << ' '; print(ans);
}
