#include <bits/stdc++.h>
using namespace std;
int n, x[100][1010], y[100][1010], ans[1010];
vector<int> a, b;
int main() {
  scanf("%d", &n);
  for (int i = 0; (1 << i) <= n; i++) {
    a.clear();
    b.clear();
    for (int j = 1; j <= n; j++)
      if (j & (1 << i))
        a.push_back(j);
      else
        b.push_back(j);
    if (a.size() > 0) {
      printf("%d\n", a.size());
      for (int j = 0; j < a.size() - 1; j++) printf("%d ", a[j]);
      printf("%d\n", a[a.size() - 1]);
      fflush(stdout);
      for (int j = 1; j <= n; j++) scanf("%d", &x[i][j]);
    }
    if (b.size() > 0) {
      printf("%d\n", b.size());
      for (int j = 0; j < b.size() - 1; j++) printf("%d ", b[j]);
      printf("%d\n", b[b.size() - 1]);
      fflush(stdout);
      for (int j = 1; j <= n; j++) scanf("%d", &y[i][j]);
    }
  }
  for (int i = 1; i <= n; i++) ans[i] = 2e9;
  for (int i = 0; (1 << i) <= n; i++)
    for (int j = 1; j <= n; j++)
      if (j & (1 << i))
        ans[j] = min(ans[j], y[i][j]);
      else
        ans[j] = min(ans[j], x[i][j]);
  puts("-1");
  for (int i = 1; i < n; i++) printf("%d ", ans[i]);
  printf("%d\n", ans[n]);
  fflush(stdout);
  return 0;
}
