#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-10;
const long long MOD = 1000000007ll;
const long long mod1 = 1000000009ll;
const long long mod2 = 1100000009ll;
int INF = (int)1e9 + 5;
long long INFINF = (long long)1e18;
vector<int> queries1[20];
vector<int> queries0[20];
int answers[1010];
int marker[1010];
int get_count(int n) {
  int ret_val = 0;
  while (n > 0) {
    ret_val++;
    n = n >> 1;
  }
  return ret_val;
}
int main() {
  int n, x, query_count;
  scanf("%d", &n);
  x = n;
  query_count = get_count(x);
  for (int k = 0; k < query_count; k++) {
    for (int i = 1; i <= n; i++) {
      int x = i >> k;
      if (x & 1)
        queries1[k].push_back(i);
      else
        queries0[k].push_back(i);
    }
  }
  for (int i = 0; i < 1010; i++) answers[i] = INF;
  int l;
  for (int k = 0; k < query_count; k++) {
    fflush(stdout);
    l = queries0[k].size();
    printf("%d\n", l);
    fflush(stdout);
    memset(marker, 0, sizeof(marker));
    for (int i = 0; i < l; i++) {
      printf("%d ", queries0[k][i]);
      marker[queries0[k][i]] = 1;
    }
    cout << endl;
    fflush(stdout);
    for (int i = 1; i <= n; i++) {
      int x;
      scanf("%d", &x);
      if (marker[i]) continue;
      answers[i] = min(answers[i], x);
    }
    fflush(stdout);
    l = queries1[k].size();
    printf("%d\n", l);
    fflush(stdout);
    memset(marker, 0, sizeof(marker));
    for (int i = 0; i < l; i++) {
      printf("%d ", queries1[k][i]);
      marker[queries1[k][i]] = 1;
    }
    cout << endl;
    fflush(stdout);
    for (int i = 1; i <= n; i++) {
      int x;
      scanf("%d", &x);
      if (marker[i]) continue;
      answers[i] = min(answers[i], x);
    }
  }
  fflush(stdout);
  cout << "-1" << endl;
  for (int i = 1; i <= n; i++) {
    printf("%d ", answers[i]);
  }
  cout << endl;
  return 0;
}
