#include <iostream>
#include <vector>
using namespace std;
vector<int> unique_set;
int binary_search(int person, int a, int b)
{
if(a == b) return a+1;
int m = (a+b)/2;
cout << m-a+2 << ' ';
for(int i = a; i <= m; i++) cout << unique_set[i] << ' ';
cout << person << ' ';
cout << endl;
int res;
cin >> res;
if(res == m-a+1) return binary_search(person, a, m);
else return binary_search(person, m+1, b);
}
int main()
{
int N;
cin >> N;
vector<int> col(N+1, 0);
cout << N << ' ';
for(int i = 1; i <= N; i++) cout << i << ' ';
cout << endl;
int C;
cin >> C;
int res;
vector<int> enabled(N+1, 1);
int enabled_count = N;
for(int i = 1; i <= N; i++)
{
if(!enabled[i]) continue;
enabled_count--;
enabled[i] = 0;
if(enabled_count == 0)
{
enabled[i] = 1;
unique_set.push_back(i);
break;
}
cout << enabled_count << ' ';
for(int j = 1; j <= N; j++)
{
if(!enabled[j]) continue;
cout << j << ' ';
}
cout << endl;
cin >> res;
if(res != C)
{
enabled_count++;
enabled[i] = 1;
unique_set.push_back(i);
}
}
for(int i = 0; i < C; i++) col[unique_set[i]] = i+1;
for(int i = 1; i <= N; i++)
{
if(enabled[i]) continue;
col[i] = binary_search(i, 0, C-1);
}
cout << "0 ";
for(int i = 1; i <= N; i++) cout << col[i] << ' ';
cout << endl;
}
