#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e3 + 5;
vector < int > arr = {0, 1, 2, 1, 1, 1};
int ask(vector < int > x){
int n = x.size();
cout << n << ' ';
for(int i : x)
cout << i << ' ';
cout << endl;
int rs = 0;
// set < int > st;
// for(int i : x)
// st.insert(arr[i]);
// rs = (int)st.size();
cin >> rs;
return rs;
}
vector < int > cut(int l, int r){
vector < int > x;
for(int i = l; i <= r; i++)
x.push_back(i);
return x;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int clr = 1;
vector < int > ans(n + 1, 0);
for(int i = 1; i <= n; i++){
if(ans[i] != 0)
continue;
ans[i] = clr;
bool ok = true;
int base = ask(cut(i, n));
for(int j = i + 1; j <= n; j++){
vector < int > cur = cut(j, n);
cur.push_back(i);
// if(ask(cur) != base && ok)
// break;
if(ask({i, j}) == 1){
ans[j] = clr;
ok = true;
}
else ok = false;
}
clr++;
}
cout << "0 ";
for(int i = 1; i <= n; i++)
cout << ans[i] << ' ';
cout << endl;
}
/*
*/
