#include <bits/stdc++.h>
using namespace std;
int ans[1111], res[1111];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) ans[i] = 1e9;
  for (int s = 1; s < n; s *= 2) {
    vector<int> idx;
    int i = 1;
    while (i <= n) {
      for (int k = 0; i <= n && k < s; ++k, ++i) idx.push_back(i);
      i += s;
    }
    if (idx.size() > 0) {
      cout << idx.size() << "\n";
      for (int i = 0; i < idx.size(); ++i)
        cout << idx[i] << " \n"[i + 1 == idx.size()];
      fflush(stdout);
      for (int i = 1; i <= n; ++i) cin >> res[i];
      for (int x : idx) res[x] = 1e9;
      for (int i = 1; i <= n; ++i) ans[i] = min(ans[i], res[i]);
    }
    idx.clear();
    i = s + 1;
    while (i <= n) {
      for (int k = 0; i <= n && k < s; ++k, ++i) idx.push_back(i);
      i += s;
    }
    if (idx.size() > 0) {
      cout << idx.size() << "\n";
      for (int i = 0; i < idx.size(); ++i)
        cout << idx[i] << " \n"[i + 1 == idx.size()];
      fflush(stdout);
      for (int i = 1; i <= n; ++i) cin >> res[i];
      for (int x : idx) res[x] = 1e9;
      for (int i = 1; i <= n; ++i) ans[i] = min(ans[i], res[i]);
    }
  }
  cout << "-1\n";
  for (int i = 1; i <= n; ++i) cout << ans[i] << " \n"[i == n];
  fflush(stdout);
  return 0;
}
