#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, base = 2;
  scanf("%d", &n);
  vector<int> one, other, res(n + 1, INT_MAX), cache(n + 1);
  while (base < 2 * n) {
    for (int i = 1; i <= n; ++i) {
      if ((i - 1) % base < base / 2)
        one.push_back(i);
      else
        other.push_back(i);
    }
    printf("%d\n", one.size());
    for (int m : one) printf("%d ", m);
    printf("\n");
    fflush(stdout);
    for (int i = 1; i <= n; ++i) scanf("%d", &cache[i]);
    for (int m : other) res[m] = min(res[m], cache[m]);
    printf("%d\n", other.size());
    for (int m : other) printf("%d ", m);
    printf("\n");
    fflush(stdout);
    for (int i = 1; i <= n; ++i) scanf("%d", &cache[i]);
    for (int m : one) res[m] = min(res[m], cache[m]);
    one.clear();
    other.clear();
    base *= 2;
  }
  printf("-1\n");
  for (int i = 1; i <= n; ++i) printf("%d ", res[i]);
  printf("\n");
  return 0;
}
