#include <bits/stdc++.h>
using namespace std;

int use[1001];
bool ask(pair<int,int> &e) {
    vector<int> v;
    for (int i = 0; i < 1001; i++)
        if (use[i])
            v.push_back(i);
    cout << "? " << v.size();
    for (int x: v) cout << ' ' << x;
    cout << '\n';
    cin >> e.first >> e.second;
    return not (e.first == -1 && e.second == -1);
}

vector<int> ask_edges(vector<int> v, int i) {
    for (int i = 0; i < 1001; i++) use[i] = false;
    for (int j: v) use[j] = true;
    use[i] = true;
    pair<int,int> e;
    vector<int> adj;
    while (ask(e)) {
        int j = e.first == i ? e.second : e.first;
        use[j] = false;
        adj.push_back(j);
    }
    return adj;
}

int main() {
    // cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;

    vector<pair<int,int>> ans;
    vector<vector<int>> buc;
    for (int i = 1; i <= n; i++) {
        bool found = false;
        for (auto &v: buc) {
            auto E = ask_edges(v, i);
            if (not found && E.empty()) {
                v.push_back(i);
                found = true;
            }
            for (int j: E) {
                ans.emplace_back(i, j);
            }
        }
        if (not found) {
            vector<int> v{i};
            buc.emplace_back(v);
        }
    }
    cout << "! " << ans.size() << '\n';
    for (auto [a, b]: ans)
        cout << a << ' ' << b << '\n';
    return 0;
}