#include <bits/stdc++.h>
using namespace std;
struct fast_ios {
  fast_ios() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  };
} fast_ios_;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
  for (long long i = 0; i < v.size(); i++) {
    cout << v[i];
    if (i != v.size() - 1) cout << endl;
  };
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
  cout << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <typename T>
void Out(T x) {
  cout << x << endl;
}
template <typename T1, typename T2>
void chOut(bool f, T1 y, T2 n) {
  if (f)
    Out(y);
  else
    Out(n);
}
using vec = vector<long long>;
using mat = vector<vec>;
using Pii = pair<long long, long long>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;
const long long mod = 1000000007;
signed main() {
  long long n;
  cin >> n;
  if (n <= 3) {
    Out(0);
    return 0;
  }
  long long R = -1, k;
  for (long long i = (2); i < (n); i++) {
    long long t = n - ((n - 1) / i + 1) - (i - 1);
    if (t > R) {
      R = t;
      k = i;
    }
  }
  v_bool f(n, false);
  long long cnt = 0;
  while (cnt < R) {
    vec v;
    for (long long i = (0); i < (n); i++) {
      if (((long long)v.size()) < k && !f[i] && i % k != 0) {
        v.push_back(i);
        f[i] = true;
        cnt++;
      }
    }
    cout << k << " ";
    for (long long i = (0); i < (k); i++) cout << v[i] + 1 << " ";
    cout << endl;
    long long x;
    cin >> x;
    x--;
    for (long long i = (0); i < (k); i++) {
      if (f[(x + i) % n]) {
        f[(x + i) % n] = false;
        cnt--;
      }
    }
  }
  Out(0);
  return 0;
}
