#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 2 * 1e5 + 100, M = 4096 + 10, len = 21, inf = 1e18;
const ll mod = 1000002022;
ll um(ll a, ll b){
return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
return ((1LL * a - b) % mod + mod) % mod;
}
int p[N], sz[N], pos[N];
vector <int> vec;
int gt(int x){
if(p[x] == x) return x;
else return p[x] = gt(p[x]);
}
void addthem(int a, int b){
a = gt(a);
b = gt(b);
if(a != b){
if(sz[b] > sz[a]) swap(a, b);
sz[a] += sz[b];
p[b] = a;
}
}
void find(int l, int r, int x){
if(r - l == 1){
addthem(vec[l], x);
return;
}
int mid = (l + r) / 2, cnt;
cout << mid - l + 1 << " "<< x << " ";
for(int i = l; i < mid; i++){
cout << vec[i] << " ";
}
cout << endl;
cin >> cnt;
if(mid - l + 1 == cnt) find(mid, r, x);
else find(l, mid, x);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for(int i = 1; i <= n; i++){
p[i] = i;
sz[i] = 1;
}
vec.pb(1);
int r = 1;
for(int i = 2, cnt; i <= n; i++){
cout << r + 1 << " " << i << " ";
for(auto u : vec){
cout << u << " ";
}
cout << endl;
cin >> cnt;
if(cnt == r + 1){
vec.pb(i);
r++;
continue;
}
find(0, r, i);
}
int cnt = 1;
for(int i = 1; i <= n; i++){
if(gt(i) == i) {
pos[i] = cnt++;
}
}
cout << 0 << " ";
for(int i = 1; i <= n; i++){
cout << pos[p[i]] << " ";
}
return 0;
}
