#include <bits/stdc++.h>
#define rep1(i, n) for (int i = 1; i <= (n); ++i)

using namespace std;
using ll = long long;
using P = pair<int, int>;

int n;
int ask(int v, vector<int>& s) {
    if (!s.size()) return 0;
    cout << "? " << 1 << " " << s.size() << " " << v;
    for (int u : s) cout << " " << u;
    cout << endl;
    int r;
    cin >> r;
    return r;
}

vector<P> es;
void f(int v, vector<int>& s) {
    if (!s.size()) return;
    int res = ask(v, s);
    if (res == 0) return;
    if (s.size() == 1) {
        es.emplace_back(v, s[0]);
        return;
    }
    int m = s.size()/2;
    vector<int> s1(s.begin(), s.begin()+m);
    vector<int> s2(s.begin()+m, s.end());
    f(v, s1);
    f(v, s2);
}

int main() {
    cin >> n;
    
    rep1(i, n) {
        vector<int> cand;
        for (int j = i+1; j <= n; ++j) cand.push_back(j);
        f(i, cand);
    }
    
    cout << "! " << es.size() << endl;
    for (auto& [u, v] : es) cout << u << " " << v << endl;
    
    return 0;
}