#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void testCase() {
    int n;
    cin >> n;

    int m = n - (n & 1);

    cout << "? " << m << ' ';

    for (int i = 1; i <= m / 2; i++)
        cout << i << ' ';

    for (int i = m / 2; i >= 1; i--)
        cout << i << ' ';

    cout << endl;

    int x;
    cin >> x;

    int a[x + 1];
    for (int i = 1; i <= x; i++)
        cin >> a[i];

    vector<int> sol[n + 1];

    for (int i = 1, l = 1, r = x; i <= m / 2; i++) {
        int y = a[r];

        while (a[l] != y)
            sol[i].push_back(a[l]), l++, r--;

        sol[i].push_back(a[l]);

        l++, r--;
    }

    cout << "? " << m << ' ';

    for (int i = m / 2 + 1; i <= m; i++)
        cout << i << ' ';

    for (int i = m; i >= m / 2 + 1; i--)
        cout << i << ' ';

    cout << endl;

    cin >> x;

    int b[x + 1];
    for (int i = 1; i <= x; i++)
        cin >> b[i];

    for (int i = m / 2 + 1, l = 1, r = x; i <= m; i++) {
        int y = b[r];

        while (b[l] != y)
            sol[i].push_back(b[l]), l++, r--;

        sol[i].push_back(b[l]);

        l++, r--;
    }

    if (n & 1) {
        cout << "? " << 1 << ' ' << n << endl;

        cin >> x;

        sol[n].resize(x);

        for (auto &i: sol[n])
            cin >> i;
    }

    cout << "! ";

    for (int i = 1; i <= n; i++) {
        cout << sol[i].size() << ' ';

        for (auto &j: sol[i])
            cout << j << ' ';
    }

    cout << endl;
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}