#include <bits/stdc++.h>
using namespace std;
template <class Q>
Q _sqr(Q x) {
  return x * x;
}
template <class Q>
void gi(Q &x) {
  char ch = getchar();
  x = 0;
  int s = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') s = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
  if (s == -1) x = -x;
}
template <class Q>
void pi(Q x) {
  if (x < 0) {
    putchar('-');
    pi(-x);
  } else {
    if (x > 9) pi(x / 10);
    putchar(x % 10 + 48);
  }
}
const int sz = 400200;
const int huge = 1000000000;
const long long int hugell = 1ll << 61;
const double hugelf = 1e50;
const double eps = 1e-10;
const int ljz = 1000000007;
void MOD(int &x) {
  if (x >= ljz) x -= ljz;
  if (x < 0) x += ljz;
}
int Tm(int a, int b) {
  long long int x = a, y = b;
  return (x * y) % ljz;
}
int fpm(int x, int y) {
  int p = 1, s = x;
  for (; y; y >>= 1) {
    if (y & 1) p = Tm(p, s);
    s = Tm(s, s);
  }
  return p;
}
int Tm(int a, int b, int c) { return Tm(Tm(a, b), c); }
int Tm(int a, int b, int c, int d) { return Tm(Tm(a, b, c), d); }
int Tm(int a, int b, int c, int d, int e) { return Tm(Tm(a, b, c, d), e); }
int Tm(int a, int b, int c, int d, int e, int f) {
  return Tm(Tm(a, b, c, d, e), f);
}
int n;
int z[12][1030], o[12][1030];
int p[1030], l;
void get(int *z, int bit, int b) {
  int i;
  l = 0;
  for (i = 1; i <= n; i++)
    if ((((i - 1) >> bit) & 1) == b) p[++l] = i;
  if (l > 0 && l < n) {
    printf("%d\n", l);
    for (i = 1; i <= l; i++) printf("%d ", p[i]);
    fflush(stdout);
    for (i = 0; i < n; i++) scanf("%d", &z[i]);
  } else
    for (i = 0; i < n; i++) z[i] = 1000000000;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; (1 << (i - 1)) < n; i++) {
    get(z[i], i, 0);
    get(o[i], i, 1);
  }
  printf("-1\n");
  for (int i = 0; i < n; i++) {
    int ans = 1000000000;
    for (int j = 0; (1 << (j - 1)) < n; j++)
      ans = min(ans, max(z[j][i], o[j][i]));
    printf("%d ", ans);
  }
  fflush(stdout);
  return 0;
}
