#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 1;
int msk[1001][21];
int it = 1;
vector<int> a;
int n;
map<vector<int>, int> mp;
void dfs(int cur, int last) {
  if (cur == 10) {
    for (int i = 1; i <= 20; ++i) msk[it][i] = 1;
    for (int i = 0; i < 10; ++i) msk[it][a[i]] = 0;
    it++;
    return;
  }
  for (int i = last + 1; i <= 20; ++i) {
    a.push_back(i);
    dfs(cur + 1, i);
    a.pop_back();
    if (it > n) break;
  }
}
int ans[1001][21];
int res[1001];
int main() {
  cin >> n;
  for (int i = 1; i <= 20; ++i)
    for (int j = 1; j <= n; ++j) ans[j][i] = 1e9 + 7;
  dfs(0, 0);
  for (int i = 1; i <= 20; ++i) {
    vector<int> query;
    for (int j = 1; j <= n; ++j)
      if (msk[j][i]) query.push_back(j);
    if (query.empty()) continue;
    if (mp[query]) continue;
    cout << query.size() << " ";
    for (int i = 0; i < query.size(); ++i) cout << query[i] << " ";
    cout << endl;
    for (int j = 1; j <= n; ++j) cin >> ans[j][i];
    mp[query] = 1;
  }
  for (int i = 1; i <= n; ++i) {
    int mn = 1e9 + 7;
    for (int j = 1; j <= 20; ++j)
      if (msk[i][j] == 0) mn = min(mn, ans[i][j]);
    res[i] = mn;
  }
  cout << -1 << endl;
  for (int i = 1; i <= n; ++i) cout << res[i] << " ";
  cout << endl;
}
