#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

random_device rd;
    mt19937 mt(rd());
    uniform_int_distribution<int> dist(0,99);

pair<vector<int>,vector<int>> split(vector<int> vs){
    int sz = vs.size();
    vector<int> ls(vs.begin(),vs.begin()+sz/2);
    vector<int> rs(vs.begin()+sz/2,vs.end());
    return {ls,rs};
}

void solve1(){
    int n; in(n);
    int qlim = 4500;
    auto ask = [&](vector<int> xs, vector<int> ys){
        if (xs.empty() || ys.empty()) return false;
        assert(qlim > 0);
        qlim--;
        for (auto &x : xs) x++;
        for (auto &y : ys) y++;
        out('?',xs.size(),ys.size(),xs,ys);
        cout << flush;
        int ret; in(ret);
        assert(ret != -1);
        return ret == 1;
    };
    vector<pii> es;
    auto efs = [&](auto tfs, vector<int> ls, vector<int> rs) -> void {
        if (ls.size() > rs.size()) swap(ls,rs);
        if (rs.size() == 1u){
            es.emplace_back(ls[0],rs[0]);
            return ;
        }
        auto [p, q] = split(rs);
        if (dist(mt) < 50){
            swap(p,q);
        }
        if (ask(ls,p)){
            tfs(tfs,ls,p);
            if (ask(ls,q)){
                tfs(tfs,ls,q);
            }
        }
        else {
            tfs(tfs,ls,q);
        }
    };
    auto dfs = [&](auto sfs, vector<int> vs) -> void {
        int sz = vs.size();
        if (sz <= 1) return ;
        auto [ls, rs] = split(vs);
        sfs(sfs,ls);
        sfs(sfs,rs);
        if (ask(ls,rs)){
            efs(efs,ls,rs);
        }
    };
    vector<int> ini(n); iota(all(ini),0);
    dfs(dfs,ini);
    out("!",es.size());
    for (auto [u, v] : es){
        out(u+1,v+1);
    }
    cout << flush;
}

void solve(){
    solve1(); return ;
    int n; in(n);
    int qlim = 4500;
    auto ask = [&](int x, vector<int> ys){
        if (ys.empty()) return false;
        assert(qlim > 0);
        qlim--;
        for (auto &y : ys) y++;
        out('?',1,ys.size(),x+1,ys);
        cout << flush;
        int ret; in(ret);
        assert(ret != -1);
        return ret == 1;
    };
    set<pii> st;
    auto push = [&](int x, int y){
        if (x > y) swap(x,y);
        st.emplace(x,y);
    };
    rep(x,n){
        auto dfs = [&](auto sfs, vector<int> ys, int state) -> int {
            if (state == 0){
                if (!ask(x,ys)) return 0;
            }
            if (ys.size() == 1u){
                int y = ys[0];
                push(x,y);
                return 1;
            }
            int sz = ys.size();
            vector<int> ls(ys.begin(),ys.begin()+sz/2);
            vector<int> rs(ys.begin()+sz/2,ys.end());
            if (dist(mt) < 50){
                int ret = sfs(sfs,ls,0);
                sfs(sfs,rs,ret == 0 ? 1 : 0);
            }
            else {
                int ret = sfs(sfs,rs,0);
                sfs(sfs,ls,ret == 0 ? 1 : 0);
            }
            return 1;
        };
        vector<int> ys(x); iota(all(ys),0);
        dfs(dfs,ys,0);
    }
    out("!",st.size());
    for (auto [u, v] : st){
        out(u+1,v+1);
    }
    cout << flush;
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}