#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  int ans[n];
  for (int i = 0; i < n; i++) ans[i] = 1e9 + 10;
  vector<int> ret;
  auto query = [&](vector<int>& v) {
    printf("%d\n", v.size());
    for (int p : v) printf("%d ", p + 1);
    printf("\n");
    fflush(stdout);
    ret.resize(n);
    for (int i = 0; i < n; i++) scanf("%d", &ret[i]);
  };
  for (int i = 0; i < 10; i++) {
    vector<int> a, b;
    for (int k = 0; k < n; k++) {
      if ((k >> i) & 1)
        a.push_back(k);
      else
        b.push_back(k);
    }
    if (a.empty() || b.empty()) continue;
    query(b);
    for (int p : a) ans[p] = min(ans[p], ret[p]);
    query(a);
    for (int p : b) ans[p] = min(ans[p], ret[p]);
  }
  printf("-1\n");
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  printf("\n");
  fflush(stdout);
}
