#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>
#include <unordered_map>
#include <bitset>
#include <chrono>


using namespace std;


#define rep(i,n) for (int i=0;i<n;i+=1)
#define rrep(i,n) for (int i=n-1;i>-1;i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()

#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << " )\n";

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<endl;
}



template<class T,class U>
ostream& operator<<(ostream& os, const pair<T,U>& A){
  os << "(" << A.first <<", " << A.second << ")";
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const set<T>& S){
  os << "set{";
  for (auto a:S){
    os << a;
    auto it = S.find(a);
    it++;
    if (it!=S.end()){
      os << ", ";
    }
  }
  os << "}";
  return os;
}

template<class T0,class T1,class T2>
ostream& operator<<(ostream& os, const tuple<T0,T1,T2>& a){
  auto [x,y,z] = a;
  os << "(" << x << ", " << y << ", " << z << ")";
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const map<ll,T>& A){
  os << "map{";
  for (auto e:A){
    os << e.first;
    os << ":";
    os << e.second;
    os << ", ";
  }
  os << "}";
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const vec<T>& A){
  os << "[";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "]" ;
  return os;
}

struct RandomNumberGenerator {
    std::mt19937 mt;

    RandomNumberGenerator() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}

    uint32_t operator()(uint32_t a, uint32_t b) {
        std::uniform_int_distribution<uint32_t> dist(a, b - 1);
        return dist(mt);
    }

    uint32_t operator()(uint32_t b) { return (*this)(0, b); }

    template <typename T> void shuffle(std::vector<T>& v) {
        for (int i = 0; i < int(v.size()); i++) std::swap(v[i], v[(*this)(0, i + 1)]);
    }
};

struct RandomNumberGenerator64 {
    std::mt19937_64 mt;

    RandomNumberGenerator64() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}

    uint64_t operator()(uint64_t a, uint64_t b) {
        std::uniform_int_distribution<uint64_t> dist(a, b - 1);
        return dist(mt);
    }

    uint64_t operator()(uint64_t b) { return (*this)(0, b); }

    template <typename T> void shuffle(std::vector<T>& v) {
        for (int i = 0; i < int(v.size()); i++) std::swap(v[i], v[(*this)(0, i + 1)]);
    }
};



void solve(){
  
  int N;
  cin>>N;

  RandomNumberGenerator64 rng;

  auto query = [&](vec<int> A){
    assert (A.size() == N);
    cout << 0 << " ";
    rep(i,N){
      cout << A[i];
      if (i == N-1){
        cout << endl;
      }
      else{
        cout << " ";
      }
    }
    int res;
    cin >> res;
    return res;
  };

  auto query_split = [&](int a,int b,int l,int m,int r,int ban){
    vec<int> A(N,ban);
    for (int i = l; i < m; i++){
      A[i] = a;
    }
    for (int i = m; i < r; i++){
      A[i] = b;
    }
    return query(A);
  };

  deque<tuple<int,int,vec<int>,int>> deq;
  vec<int> res(N,-1);

  vec<int> init_valset(N);
  rep(i,N) init_valset[i] = i+1;
  deq.push_back({0,N,init_valset,-1});

  while (!deq.empty()){
    auto [l,r,val_set,ban] = deq.front(); deq.pop_front();

    if (r-l==1){
      res[l] = val_set[0];
      continue;
    }

    int m = (l+r)>>1;
    vec<vec<int>> undet;
    for (auto x:val_set){
      undet.push_back({x});
    }
    vec<int> left_val,right_val;

    while (!undet.empty()){

      int undet_n = undet.size();
      rng.shuffle(undet);
      vec<vec<int>> nxt_undet;
      for (int i = 0; i < undet_n-1; i += 2){
        int a = undet[i][0], b = undet[i+1][0];

        int check = query_split(a,b,l,m,r,ban);

        if (check == 2){
          for (auto x:undet[i]){
            left_val.push_back(x);
          }
          for (auto x:undet[i+1]){
            right_val.push_back(x);
          }
        }
        else if (check == 0){
          for (auto x:undet[i+1]){
            left_val.push_back(x);
          }
          for (auto x:undet[i]){
            right_val.push_back(x);
          }
        }
        else{
          vec<int> merged_undet;
          for (auto x:undet[i]){
            merged_undet.push_back(x);
          }
          for (auto x:undet[i+1]){
            merged_undet.push_back(x);
          }
          nxt_undet.push_back(merged_undet);
        }
      }

      if (undet_n & 1){
        if (!nxt_undet.empty()){
          int c = nxt_undet[0].size();
          int rest_left = (m-l) - int(left_val.size());
          int rest_right = (r-m) - int(right_val.size());
          if ((rest_left % c) == (int(undet.back().size()))){
            for (auto x:undet.back()){
              left_val.push_back(x);
            }
          }
          else{
            for (auto x:undet.back()){
              right_val.push_back(x);
            }
          }
        }
        else{
          if (int(left_val.size()) != m-l){
            for (auto x:undet.back()){
              left_val.push_back(x);
            }
          }
          else{
            for (auto x:undet.back()){
              right_val.push_back(x);
            }
          }
        }
      }

      undet = nxt_undet;
    }

    deq.push_back({l,m,left_val,left_val[0]});
    deq.push_back({m,r,right_val,right_val[0]});
  }

  cout << 1 << " ";
  rep(i,N){
    cout << res[i];
    if (i == N-1){
      cout << endl;
    }
    else{
      cout << " ";
    }
  }

  return ;
  

  
  




}


int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int T = 1;
  while (T--){
    solve();
  }
}