#include <bits/stdc++.h>
using namespace std;
#define pub push_back
int n, now, bef = 1;
int ans[155];
int tanya = 0;
vector<int>q;
int main(){
cin >> n;
ans[1] = 1;
q.pub(1);
for(int i=2;i<=n;i++){
cout << q.size()+1;
for(int elm:q)
cout << " " << elm;
cout << " " << i << endl << flush;
tanya++;
cin >> now;
if(now != bef){
q.pub(i);
ans[i] = now;
}else{
int le = 0,
ri = q.size()-1;
while(ri-le > 1){
int mid = (le+ri)/2;
cout << abs(le-mid)+2;
for(int j=le;j<=mid;j++)
cout << " " << q[j];
cout << " " << i << endl << flush;
tanya++;
int resp;
cin >> resp;
if(resp == abs(le-mid)+1){
ri = mid;
}else le = mid + 1;
}
int resp;
cout << "2 " << q[le] << " " << i << endl << flush;
tanya++;
cin >> resp;
if(resp == 2) ans[i] = ans[q[ri]];
else ans[i] = ans[q[le]];
}
swap(now, bef);
}
assert(tanya < 600);
cout << 0;
for(int i=1;i<=n;i++)
cout << " " << ans[i];
cout << endl << flush;
}
