#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int n;
vector<pii> ans;
int tot = 0;
vector<int> Ask(const vector<int> &a) {
    tot += a.size();
    assert(tot <= 176000);
    // if (tot > 176000) return vector<int>(a.size(), 0);
    vector<int> cnt(a.size());
    cout << "? " << a.size();
    for (auto x : a) cout << ' ' << x;
    cout << endl;
    fflush(stdout);
    for (int i = 0; i < (int)cnt.size(); ++i) cin >> cnt[i];
    return cnt;
}
mt19937 rd(1025);
typedef vector<int>::iterator vit;
inline void Process(vit pl, vit pr, const vector<int> &Q) {
    if (pl == pr) return;
    if (pl + 1 == pr) {
        // cerr << *pl << ' ' << Q.size() << " **\n";
        vector<int> que(Q);
        que.insert(que.begin(), *pl);
        vector<int> cnt = Ask(que);
        for (int i = 0; i < (int)Q.size(); ++i) {
            int k = cnt[i + 1];
            while (k--) ans.push_back({Q[i], *pl});
        }
        return;
    }
    vit pm = pl + (pr - pl) / 2;
    vector<int> q1(pl, pm), q2(pm, pr);
    q1.insert(q1.end(), Q.begin(), Q.end());
    q2.insert(q2.end(), Q.begin(), Q.end());
    vector<int> cnt1 = Ask(q1);
    vector<int> cnt2 = Ask(q2);
    vector<int> QL, QR;
    for (int i = 0; i < Q.size(); ++i) if (cnt1[i + (pm - pl)]) QL.push_back(Q[i]);
    for (int i = 0; i < Q.size(); ++i) if (cnt2[i + (pr - pm)]) QR.push_back(Q[i]);
    if (QL.size()) Process(pl, pm, QL);
    if (QR.size()) Process(pm, pr, QR);
}
inline void Solve(vector<int> a) {
    shuffle(a.begin(), a.end(), rd);
    vector<int> cnt = Ask(a);
    vector<int> P, Q;
    int n = cnt.size();
    for (int i = 0; i < n; ++i)
        (cnt[i] ? Q : P).push_back(a[i]);
    if (Q.size()) {
        Process(P.begin(), P.end(), Q);
        if (Q.size() > 1) Solve(Q);
    }
}
int main() {
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) a[i] = i + 1;
    for (int i = 1; i <= n; ++i) {
        int k = Ask({i, i})[1];
        while (k--) ans.push_back({i, i});
    }
    Solve(a);
    cout << "! " << ans.size();
    for (auto [x, y] : ans) cout << ' ' << x << ' ' << y;
    cout << endl;
    fflush(stdout);
    return 0;
}