/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
//#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 5e5 + 5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;

vector<int> ask(vector<int> val) {
    cout << "? " << val.size();
    for (auto x: val) cout << ' ' << x;
    cout << endl;
    int sz;
    cin >> sz;
    vector<int> ret(sz);
    f(i, 0, sz) cin >> ret[i];
    return ret;
}

vector<vector<int>> ans;

void solve(int l, int r) {
    if (l > r)return;
    vector<int> vec;
    f(i, l, r + 1)vec.push_back(i), vec.push_back(i);
    auto p = ask(vec);
    map<int, vector<int>> mp;
    f(i, 0, p.size())mp[p[i]].push_back(i);
    for (int i = 0; i < p.size();) {
        int index = *upper_bound(all(mp[p[i]]), i);
        ans.push_back(vector<int>());
        f(j, i, index)ans.back().push_back(p[j]);
        i += ans.back().size() * 2;
    }
}

void doWork() {

    int n;
    cin >> n;
    solve(1, n / 2);
    solve(n / 2 + 1, n - (n & 1));
    if (n & 1)
        ans.push_back(ask({n}));
    cout << "!";
    for (auto x: ans) {
        cout << ' ' << x.size();
        for (auto v: x) cout << ' ' << v;
    }
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}