#include <bits/stdc++.h>
using namespace std;
#define POPCOUNT(n) (__builtin_popcountll((n)))
#define CLZ(n) (__builtin_clzll((n)))
#define CTZ(n) (__builtin_ctzll((n)))
#define LOG(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2> bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2> bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
long long random(long long l, long long r) {
return uniform_int_distribution<long long>(l, r)(rng);
}
template <class T> T random(T r) {
return rng() % r;
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;
struct DSU {
vector<int> lab;
DSU() {}
void resize(int n) {
lab.assign(n + 1, -1);
}
int find_set(int p) {
return lab[p] < 0 ? p : lab[p] = find_set(lab[p]);
}
bool same_set(int u, int v) {
return find_set(u) == find_set(v);
}
bool join(int u, int v) {
u = find_set(u), v = find_set(v);
if (u != v) {
if (lab[u] > lab[v]) swap(u, v);
lab[u] += lab[v], lab[v] = u;
return true;
}
return false;
}
} dsu;
int ask(vector<int> ve) {
cout << ve.size() << ' ';
for (auto &x : ve) cout << x << ' ';
cout << endl;
int ret; cin >> ret; return ret;
}
signed main() {
int n; cin >> n;
vector<int> p(n);
iota(p.begin(), p.end(), 1);
dsu.resize(n);
while (true) {
int low = 0, high = p.size() - 1, r = -1;
while (low <= high) {
int mid = (low + high) >> 1;
int tmp = ask(vector<int>(p.begin(), p.begin() + mid + 1));
if (tmp != mid + 1) high = (r = mid) - 1;
else low = mid + 1;
}
if (r == -1) break;
// cerr << r << '\n';
low = 0, high = r - 1; int l = -1;
while (low <= high) {
int mid = (low + high) >> 1;
int tmp = ask(vector<int>(p.begin() + mid, p.begin() + r + 1));
if (tmp != r - mid + 1) low = (l = mid) + 1;
else high = mid - 1;
}
dsu.join(p[l], p[r]);
p.erase(p.begin() + r);
}
vector<int> num(n + 1, 0); int cnt = 0;
cout << "0 ";
for (int i = 1; i <= n; ++i) {
int p = dsu.find_set(i);
if (num[p] == 0) num[p] = ++cnt;
cout << num[p] << ' ';
}
cout << endl;
return 0;
}
