#include <bits/stdc++.h>
using namespace std;
namespace Wilson_Inversion {
  void main();
}
int main() {
  return Wilson_Inversion::main(), 0;
}
namespace Wilson_Inversion {
  const int N = 1010;
  int f[N], ans[N];
  int n;
  int find(int x) {
    return f[x] == x ? x : (f[x] = find(f[x]));
  }
  int bel[N];
  void sol(vector<int> x, int l, int r) {
    if (l == r) {
      ans[l] = x[0];
      return;
    }
    vector<int> res = x, ld, rd;
    int mid = (l + r) >> 1;
    for (int i : x) f[i] = i, bel[i] = 0;
    while (res.size()) {
      if (res.size() == 1) {
        int t = 0;
        for (int i : x) if (bel[find(i)]) {
          t = i;
          break;
        }
        cout << "0 ";
        for (int i = 1; i < l; ++i) cout << res[0] << " ";
        for (int i = l; i <= mid; ++i) cout << res[0] << " ";
        for (int i = mid + 1; i <= r; ++i) cout << t << " ";
        for (int i = r + 1; i <= n; ++i) cout << res[0] << " ";
        cout << '\n';
        cout << flush;
        int ti;
        cin >> ti;
        if (bel[find(t)] == 1) {
          if (ti == 1) bel[res[0]] = 1;
          else bel[res[0]] = 2;
        } else if(bel[find(t)] == 2) {
          if (ti == 2) bel[res[0]] = 1;
          else bel[res[0]] = 2;
        }
        break;
      }
      vector<int> t;
      while (res.size() > 1) {
        int x = res.back();
        res.pop_back();
        int y = res.back();
        res.pop_back();
        cout << "0 ";
        for (int i = 1; i < l; ++i) cout << y << " ";
        for (int i = l; i <= mid; ++i) cout << x << " ";
        for (int i = mid + 1; i <= r; ++i) cout << y << " ";
        for (int i = r + 1; i <= n; ++i) cout << y << " ";
        cout << '\n';
        cout << flush;
        int ti;
        cin >> ti;
        if (ti == 0) bel[x] = 2, bel[y] = 1;
        else if (ti == 2) bel[x] = 1, bel[y] = 2;
        else {
          f[y] = x;
          bel[x] = 0;
          t.push_back(x);
        }
      }
      if (res.size() == 1) t.push_back(res[0]);
      res = t;
    }
    for (int i : x) {
      if (bel[find(i)] == 1) ld.push_back(i);
      else rd.push_back(i);
    }
    sol(ld, l, mid);
    sol(rd, mid + 1, r);
  }
  mt19937 seed(chrono::system_clock().now().time_since_epoch().count());
  void solve() {
    cin >> n;
    vector<int> num;
    for (int i = 1; i <= n; ++i) num.push_back(i);
    shuffle(num.begin(), num.end(), seed);
    sol(num, 1, n);
    cout << "1 ";
    for (int i = 1; i <= n; ++i) cout << ans[i] << ' ';
    cout << '\n';
    cout << flush;
  }
  void main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) solve();
  }
}