#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

bool ask(unordered_set<int> &s, pair<int,int> &e) {
    if (s.size() <= 1) {
        return false;
    }

    printf("? %d", (int)s.size());
    for (int x: s)
        printf(" %d", x);
    printf("\n");
    fflush(stdout);
    scanf("%d%d", &e.first, &e.second);
    return not (e.first == -1 && e.second == -1);
}

vector<int> ask_edges(const vector<int> &v, int i) {
    unordered_set<int> st(v.begin(), v.end());
    st.insert(i);
    pair<int,int> e;
    vector<int> adj;
    while (ask(st, e)) {
        int j = e.first == i ? e.second : e.first;
        adj.push_back(j);
        st.erase(j);
    }
    return adj;
}

int main() {
    // cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    scanf("%d", &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);
        }
    }

    printf("! %d\n", (int)ans.size());
    for (auto [a, b]: ans)
        printf("%d %d\n", a, b);

    return 0;
}