#include <bits/stdc++.h>
using namespace std;
const int N = 1111;
vector<int> a[20];
int s[20][N], sk[20];
int n;
int main() {
  scanf("%d", &n);
  for (int k = 0; k < 10; ++k) {
    for (int i = 0; i < n; ++i) {
      if (i >> k & 1) {
        a[k * 2].push_back(i + 1);
      } else {
        a[k * 2 + 1].push_back(i + 1);
      }
    }
  }
  for (int i = 0; i < 20; ++i) {
    if (a[i].size() == 0 || a[i].size() >= n) {
      sk[i] = 1;
      continue;
    }
    printf("%d\n", (int)a[i].size());
    for (int b : a[i]) {
      printf("%d ", b);
    }
    printf("\n");
    fflush(stdout);
    for (int j = 0; j < n; ++j) {
      scanf("%d", &s[i][j]);
    }
  }
  printf("-1\n");
  fflush(stdout);
  for (int c = 0; c < n; ++c) {
    int nw = 0x7fffffff;
    for (int k = 0; k < 10; ++k) {
      if (c >> k & 1) {
        if (!sk[k * 2 + 1]) nw = min(nw, s[k * 2 + 1][c]);
      } else {
        if (!sk[k * 2]) nw = min(nw, s[k * 2][c]);
      }
    }
    printf("%d%s", nw, c == n - 1 ? "\n" : " ");
  }
  fflush(stdout);
  return 0;
}
