#include<iostream>
#include<algorithm>
#include<vector>
#include<random>

using namespace std;

int n, a[1010], f[1010], sz[1010], cl, cr;
bool b[1010];

mt19937 Rand(time(0));

vector<int> S;

int F(int x){
  return (f[x] ? f[x] = F(f[x]) : x);
}

int Ask(int mid, int x, int y){
  int c = 0;
  cout << "0 ";
  for(int i = 1; i <= mid; i++) cout << x << " ";
  for(int i = mid + 1; i <= n; i++) cout << y << " ";
  cout << endl;
  cin >> c;
  if(c == 1){
    f[x] = y, sz[y] += sz[x];
    return 1;
  }
  if(c == 2) cl += sz[x], cr += sz[y], b[y] = 1;
  else cl += sz[y], cr += sz[x], b[x] = 1;
  return 2;
}

void Solve(int l, int r){
  if(l == r) return;
  // shuffle(a + l, a + r + 1, Rand);
  for(int i = l; i <= r; i++) b[a[i]] = f[a[i]] = 0, sz[a[i]] = 1;
  cl = cr = 0;
  int p = l, mid = (l + r) >> 1;
  while(p < r) p += Ask(mid, a[p], a[p + 1]);
  if(p == r) b[a[p]] = (cl == mid - l + 1);
  for(int i = l; i <= r; i++){
    b[a[i]] = b[F(a[i])];
  }
  for(int i = l, j = r; i < j; ){
    while(i < j && !b[a[i]]) i++;
    while(i < j && b[a[j]]) j--;
    swap(a[i], a[j]);
  }
  Solve(l, mid), Solve(mid + 1, r);
}

int main(){
  cin >> n;
  for(int i = 1; i <= n; i++) a[i] = i;
  shuffle(a + 1, a + n + 1, Rand);
  Solve(1, n);
  cout << 1 << " ";
  for(int i = 1; i <= n; i++){
    cout << a[i] << " ";
  }
  cout << endl;
  return 0;
}